Péter Komjáth

Follow

Generating author description...

All published works
Action Title Year Authors
+ The Erdős-Hajnal problem list 2025 Péter Komjáth
+ PDF Chat Corrigendum to “Countable Decompositions of $$R^2$$ and $$R^3$$” 2023 Péter Komjáth
+ PDF Chat A Coloring of the Plane Without Monochromatic Right Triangles 2023 Balázs Bursics
Péter Komjáth
+ A coloring of the plane without monochromatic right triangles 2023 Balázs Bursics
Péter Komjáth
+ PDF Chat NOTES ON SOME ERDŐS–HAJNAL PROBLEMS 2021 Péter Komjáth
+ Monocolored topological complete graphs in colorings of uncountable complete graphs 2021 Péter Komjáth
Saharon Shelah
+ PDF Chat WEISS'S QUESTION 2020 Péter Komjáth
+ PDF Chat Constructions of infinite graphs with Ramsey property 2020 Péter Komjáth
+ PDF Chat The Colouring Number of Infinite Graphs 2019 Nathan Bowler
Johannes Carmesin
Péter Komjáth
Christian Reiher
+ Universal graphs omitting finitely many finite graphs 2019 Péter Komjáth
Saharon Shelah
+ Minimal covering sets for infinite set systems 2019 Péter Komjáth
+ A note on set mappings: an extension of results of Hajnal and Máté under GCH 2019 Péter Komjáth
+ Infinite monochromatic sumsets for colourings of the reals 2018 Péter Komjáth
Imre Leader
Paul A. Russell
Saharon Shelah
Dániel T. Soukup
Zoltán Vidnyánszky
+ A Ramsey theorem for metric spaces 2018 Péter Komjáth
+ Note A Ramsey Statement for Infinite Groups 2018 Péter Komjáth
+ SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS 2018 Péter Komjáth
+ Infinite monochromatic sumsets for colourings of the reals 2017 Péter Komjáth
Imre Leader
Paul A. Russell
Saharon Shelah
Dániel T. Soukup
Zoltán Vidnyánszky
+ On the connectivity of infinite graphs 2017 Péter Komjáth
+ A Theorem on Countable Ordered Sets with an Application to Universal Graphs 2017 Péter Komjáth
+ On a theorem of Galvin and Nagy 2017 Péter Komjáth
+ Consistently P(ω 1) is the union of less than $${2^{{\aleph _1}}}$$ 2 ℵ 1 strongly independent families 2017 Péter Komjáth
Saharon Shelah
+ Infinite monochromatic sumsets for colourings of the reals 2017 Péter Komjáth
Imre Leader
Paul A. Russell
Saharon Shelah
Dániel T. Soukup
Zoltán Vidnyánszky
+ Hadwiger’s conjecture for uncountable graphs 2016 Péter Komjáth
+ PDF Chat Well Ordering Groups with no Monotone Arithmetic Progressions 2016 Gyula Károlyi
Péter Komjáth
+ A problem of Laczkovich: How dense are set systems with no large independent sets? 2016 Péter Komjáth
+ A Certain 2-Coloring of the Reals 2016 Péter Komjáth
+ A remark on hereditarily nonparadoxical sets 2015 Péter Komjáth
+ The colouring number of infinite graphs 2015 Nathan Bowler
Johannes Carmesin
Péter Komjáth
Christian Reiher
+ On a result of Thomassen 2015 Péter Komjáth
+ A note on uncountable chordal graphs 2015 Péter Komjáth
+ The colouring number of infinite graphs 2015 Nathan Bowler
Johannes Carmesin
Péter Komjáth
Christian Reiher
+ PDF Chat Another proof of a result of Jech and Shelah 2013 Péter Komjáth
+ Note on the point character of l 1-spaces 2013 Christian Avart
Péter Komjáth
Vojtěch Rödl
+ A note on chromatic number and connectivity of infinite graphs 2013 Péter Komjáth
+ Set Theory: Geometric and Real 2013 Péter Komjáth
+ Erdős’s Work on Infinite Graphs 2013 Péter Komjáth
+ The list-chromatic number of infinite graphs 2012 Péter Komjáth
+ A Galvin–Hajnal conjecture on uncountably chromatic graphs 2012 Péter Komjáth
+ GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES 2011 Péter Komjáth
James H. Schmerl
+ Conflict free colorings of nonuniform systems of infinite sets 2011 Péter Komjáth
+ The quasi order of graphs on an ordinal 2011 Péter Komjáth
Jean A. Larson
Norbert Sauer
+ The chromatic number of infinite graphs — A survey 2010 Péter Komjáth
+ PDF Chat The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces 2009 Péter Komjáth
+ Colorful flowers 2009 Christian Avart
Péter Komjáth
Tomasz Łuczak
V. Rödl
+ PDF Chat A note on almost disjoint families 2008 Péter Komjáth
+ An uncountably chromatic triple system 2008 Péter Komjáth
+ Obligatory subsystems of triple systems 2007 A. Hajnal
Péter Komjáth
+ THE CLUB GUESSING IDEAL: COMMENTARY ON A THEOREM OF GITIK AND SHELAH 2005 Matthew Foreman
Péter Komjáth
+ PDF Chat Finite subgraphs of uncountably chromatic graphs 2005 Péter Komjáth
Saharon Shelah
+ Wild edge colourings of graphs 2004 Mirna Džamonja
Péter Komjáth
Charles G. Morgan
+ PDF Chat A Partition Theorem for Scattered Order Types 2003 Péter Komjáth
Saharon Shelah
+ Some Remarks on the Simultaneous Chromatic Number 2003 A. Hajnal
Péter Komjáth
+ The Two Points Theorem of Mazurkiewicz 2002 Péter Komjáth
James H. Schmerl
+ PDF Chat Five degrees of separation 2002 Péter Komjáth
+ Finite subgraphs of uncountably chromatic graphs 2002 Péter Komjáth
Saharon Shelah
+ A partition theorem for scattered order types 2002 Péter Komjáth
Saharon Shelah
+ Review: James E. Baumgartner, Generic Graph Construction; Matthew Foreman, Richard Laver, Some Downwards Transfer Properties for $\mathscr{N}_2$; Saharon Shelah, A. Baker, B. Bollobas, A. Hajnal, Incompactness for Chromatic Numbers of Graphs 2001 Péter Komjáth
+ A combinatorial property of cardinals 2001 Péter Komjáth
Miklós Laczkovich
+ Three clouds may cover the plane 2001 Péter Komjáth
+ Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems 2001 Péter Komjáth
+ PDF Chat A Ramsey-style extension of a theorem of Erdős and Hajnal 2001 Péter Komjáth
+ Two consistency results on set mappings 2000 Péter Komjáth
Saharon Shelah
+ Some remarks on the partition calculus of ordinals 1999 Péter Komjáth
+ Some remarks on universal graphs 1999 Péter Komjáth
+ A Coloring Result for the Plane 1999 Péter Komjáth
+ Consistency of the existence of a 4-place function on aleph_2 with no independent subset of size k_n 1998 Péter Komjáth
Saharon Shelah
+ PDF Chat Distinguishing two partition properties of $ω_1$ 1998 Péter Komjáth
+ Two Remarks on the Coloring Number 1997 Péter Komjáth
+ A Note on ω<sub>1</sub> → ω<sub>1</sub> Functions 1997 Péter Komjáth
+ On the existence of countable universal graphs 1997 Zoltán Füredi
Péter Komjáth
+ Tomek Bartoszyński and Haim Judah. Set theory. On the structure of the real line. A K Peters, Wellesley, Mass., 1995, xi + 546 pp. 1997 Péter Komjáth
+ Set Theory: Geometric and Real 1997 Péter Komjáth
+ PDF Chat A strongly non-Ramsey uncountable graph 1997 Péter Komjáth
+ On taylor's problem 1996 Péter Komjáth
Saharon Shelah
+ PDF Chat Coloring finite subsets of uncountable sets 1996 Péter Komjáth
Saharon Shelah
+ Coloring finite subsets of uncountable sets 1995 Péter Komjáth
Saharon Shelah
+ Universal Graphs without Large Cliques 1995 Péter Komjáth
Saharon Shelah
+ A note on minors of uncountable graphs 1995 Péter Komjáth
+ Coloring finite subsets of uncountable sets 1995 Péter Komjáth
Saharon Shelah
+ PDF Chat Set mappings on generalized linear continua 1995 Péter Komjáth
+ There is no universal countable pentagon‐free graph 1994 Gregory Cherlin
Péter Komjáth
+ On a Conjecture of Rödl and Voigt 1994 Péter Komjáth
E. C. Milner
+ Partitions of vector spaces 1994 Péter Komjáth
+ Ramsey-Theory and Forcing Extensions 1994 Péter Komjáth
+ A consistency result concerning set mappings 1994 Péter Komjáth
+ A Decomposition Theorem for R n 1994 Péter Komjáth
+ On Taylor's problem 1994 Péter Komjáth
Saharon Shelah
+ A note on a set-mapping problem of Hajnal and Máté 1994 Péter Komjáth
Saharon Shelah
+ PDF Chat A decomposition theorem for 𝑅ⁿ 1994 Péter Komjáth
+ PDF Chat Ramsey theory and forcing extensions 1994 Péter Komjáth
+ On Taylor's problem 1994 Péter Komjáth
Saharon Shelah
+ On uniformly antisymmetric functions 1993 Péter Komjáth
Saharon Shelah
+ Universal graphs without large cliques 1993 Péter Komjáth
Saharon Shelah
+ A consistent edge partition theorem for infinite graphs 1993 Péter Komjáth
Saharon Shelah
+ Chapter XII. Set Theoretic Constructions in Euclidean Spaces 1993 Péter Komjáth
+ Set Theoretic Constructions in Euclidean Spaces 1993 Péter Komjáth
+ On uniformly antisymmetric functions 1993 Péter Komjáth
Saharon Shelah
+ Universal graphs without large cliques 1993 Péter Komjáth
Saharon Shelah
+ PDF Chat Vector sets with no repeated differences 1993 Péter Komjáth
+ Martin's axiom and spanning trees of infinite graphs 1992 Péter Komjáth
+ Universal elements and the complexity of certain classes of infinite graphs 1991 Péter Komjáth
János Pach
+ A set mapping with no infinite free subsets 1991 Péter Komjáth
+ A Second Category Set with Only First Category Functions 1991 Péter Komjáth
+ Tetrahedron Free Decomposition of R<sup>3</sup> 1991 Péter Komjáth
+ PDF Chat A second category set with only first category functions 1991 Péter Komjáth
+ PDF Chat Countable decompositions ofR 2 andR 3 1990 Paul Erdős
Péter Komjáth
+ PDF Chat On second-category sets 1989 Péter Komjáth
+ Consistency results on infinite graphs 1988 Péter Komjáth
+ Forcing constructions for uncountably chromatic graphs 1988 Péter Komjáth
Saharon Shelah
+ Some universal graphs 1988 Péter Komjáth
Alan H. Mekler
János Pach
+ A compactness theorem for perfect matchings in matroids 1988 Péter Komjáth
E. C. Milner
Norbert Polat
+ PDF Chat Embedding graphs into colored graphs 1988 A. Hajnal
Péter Komjáth
+ PDF Chat Large small sets 1988 Péter Komjáth
+ Ramsey-type results for metric spaces 1987 Péter Komjáth
+ A compactness theorem for perfect matchings in matroids 1987 Péter Komjáth
E. C. Milner
Norbert Polat
+ On representing sets of an almost disjoint family of sets 1987 Péter Komjáth
E. C. Milner
+ On k-transversals 1987 Ron Aharoni
Péter Komjáth
+ PDF Chat Morasses and the Lévy-collapse 1987 Péter Komjáth
+ Some higher-gap examples in combinatorial set theory 1987 A. Hajnal
Péter Komjáth
+ The Colouring Number 1987 Péter Komjáth
+ PDF Chat Partitioning topological spaces into countably many pieces 1987 Péter Komjáth
William Weiss
+ Coloring of universal graphs 1986 Péter Komjáth
Vojtěch Rödl
+ An infinite version of Ryser's inequality 1986 Péter Komjáth
+ Connectivity and chromatic number of infinite graphs 1986 Péter Komjáth
+ Comparing almost-disjoint families 1986 Péter Komjáth
+ Coloring graphs with locally few colors 1986 P. Erdős
Zoltán Füredi
A. Hajnal
Péter Komjáth
V. Rödl
Ákos Seress
+ Stationary reflections for uncountable cofinality 1986 Péter Komjáth
+ Universal graphs without large bipartite subgraphs 1984 Péter Komjáth
János Pach
+ On the limit superior of analytic sets 1984 Péter Komjáth
+ Families close to disjoint ones 1984 Péter Komjáth
+ What must and what need not be contained in a graph of uncountable chromatic number? 1984 A. Hajnal
Péter Komjáth
+ A continuous generalization of the transversal property 1984 Péter Komjáth
+ PDF Chat Large Sets not Containing Images of a Given Sequence 1983 Péter Komjáth
+ PDF Chat A note on Jensen’s covering lemma 1983 Péter Komjáth
+ PDF Chat Boolean algebras in which every chain and antichain is countable 1981 James E. Baumgartner
Péter Komjáth
+ The admissible trace problem for E-unitary inverse semigroups 1977 Karl Byleen
Péter Komjáth
+ PDF Chat Rearranging transfinite series of ordinals 1977 Péter Komjáth
+ The transversal property implies Property B 1976 Gerhard Hoffmann
Péter Komjáth
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat On chromatic number of graphs and set-systems 1966 Péter L. Erdős
A. Hajnal
26
+ PDF Chat On chromatic number of graphs and set systems 1973 Paul Erdös
A. Hajnal
B. Rothchild
25
+ A compactness theorem for singular cardinals, free algebras, Whitehead problem and tranversals 1975 Saharon Shelah
15
+ PDF Chat A partition calculus in set theory 1956 Péter L. Erdős
R. Rado
12
+ Set Mappings, Partitions, and Chromatic Numbers 1975 A. Hajnal
Attila Máté
10
+ Set Theoretic, Measure Theoretic, Combinatorial, and Number Theoretic Problems Concerning Point Sets in Euclidean Space 1978 Erdös
9
+ PDF Chat On non-denumerable graphs 1943 Paul Erdős
Shizuo Kakutani
9
+ PDF Chat Universal graphs and universal functions 1964 R. Rado
8
+ What must and what need not be contained in a graph of uncountable chromatic number? 1984 A. Hajnal
Péter Komjáth
8
+ A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number 1960 Péter L. Erdős
R. Rado
7
+ PDF Chat Partitioning pairs of countable ordinals 1987 Stevo Todorčević
7
+ Cycles in graphs of uncountable chromatic number 1983 Carsten Thomassen
7
+ D. H. Fremlin. Consequences of Martin's axiom. Cambridge tracts in mathematics, no. 84. Cambridge University Press, Cambridge etc. 1984, xii + 325 pp. 1988 Jason Weiss
7
+ Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring 1970 Jon Folkman
7
+ The Colouring Number 1987 Péter Komjáth
7
+ On a property of families of sets 1964 Péter L. Erdős
A. Hajnal
7
+ Graph Theory and Probability 2009 P. Erdős
6
+ On the structure of set-mappings 1958 Péter L. Erdős
A. Hajnal
6
+ A Decomposition Theorem for R n 1994 Péter Komjáth
6
+ Partitioning the plane into denumerably many sets without repeated distances 1972 Roy O. Davies
6
+ Consequences of Martin's Axiom 1984 D. H. Fremlin
6
+ PDF Chat Graph Theory and Probability 1959 Paul Erdős
5
+ Connectivity and chromatic number of infinite graphs 1986 Péter Komjáth
5
+ Some results and problems on set theory 1960 A. Hajnal
5
+ Set Theory An Introduction to Independence Proofs 1980 Kenneth Kunen
5
+ Tetrahedron Free Decomposition of R<sup>3</sup> 1991 Péter Komjáth
5
+ Consistency of positive partition theorems for graphs and models 1989 Saharon Shelah
5
+ A new class of order types 1976 James E. Baumgartner
5
+ PDF Chat Embedding graphs into colored graphs 1988 A. Hajnal
Péter Komjáth
5
+ Remarks on superatomic boolean algebras 1987 James E. Baumgartner
Saharon Shelah
5
+ Infinite and Finite Sets 2003 Ethan D. Bloch
5
+ Universal graphs without large bipartite subgraphs 1984 Péter Komjáth
János Pach
5
+ Consistency results on infinite graphs 1988 Péter Komjáth
4
+ STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS 2014 4
+ PDF Chat On the combinatorial problems which I would most like to see solved 1981 P. Erdős
4
+ PDF Chat Some remarks on set theory 1950 Péter L. Erdős
4
+ Some universal graphs 1988 Péter Komjáth
Alan H. Mekler
János Pach
4
+ PDF Chat Countable decompositions ofR 2 andR 3 1990 Paul Erdős
Péter Komjáth
4
+ Partition Relations Connected with the Chromatic Number of Graphs 1959 Péter L. Erdős
R. Rado
4
+ Covering the Plane with Denumerably Many Curves 1963 Roy O. Davies
4
+ Covering Space with Denumerably many Curves 1974 Roy O. Davies
4
+ PDF Chat A proof (involving Martin's axiom) of a partition relation 1973 James E. Baumgartner
A. Hajnal
4
+ Notes on combinatorial set theory 1973 Saharon Shelah
4
+ PDF Chat A Negative Partition Relation 1971 A. Hajnal
4
+ PDF Chat On Almost Bipartite Large Chromatic Graphs 1982 P. Erdős
A. Hajnal
Endre Szemerédi
4
+ A theorem and some consistency results in partition calculus 1987 Saharon Shelah
Lee Stanley
4
+ The Ramsey property for graphs with forbidden complete subgraphs 1976 Jaroslav Nešetřil
Vojtěch Rödl
4
+ Generic graph construction 1984 James E. Baumgartner
4
+ On Shelah’s compactness of cardinals 1978 Shai Ben-David
4
+ Set Theory 1999 A. Hajnal
Peter Hamburger
4