Péter Komjáth

58 papers Journal 55Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
The ERDőS-Hajnal Problem List.
Bull. Symb. Log.
Péter Komjáth
2024 J jnl
Corrigendum to "Countable Decompositions of R
Discret. Comput. Geom.
Péter Komjáth
2021 J jnl
Notes on some ERDőS-Hajnal Problems.
J. Symb. Log.
Péter Komjáth
2020 J jnl
Constructions of infinite graphs with Ramsey property.
J. Graph Theory
Péter Komjáth
2019 J jnl
Minimal covering sets for infinite set systems.
Discret. Math.
Péter Komjáth
2019 J jnl
The Colouring Number of Infinite Graphs.
Comb.
Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher
2019 J jnl
Universal graphs omitting finitely many finite graphs.
Discret. Math.
Péter Komjáth, Saharon Shelah
2018 J jnl
A Ramsey theorem for metric spaces.
Discret. Math.
Péter Komjáth
2018 J jnl
Note A Ramsey Statement for Infinite Groups.
Comb.
Péter Komjáth
2017 J jnl
Well Ordering Groups with no Monotone Arithmetic Progressions.
Order
Gyula Károlyi, Péter Komjáth
2016 J jnl
A problem of Laczkovich: How dense are set systems with no large independent sets?
Ann. Pure Appl. Log.
Péter Komjáth
2016 J jnl
A remark on hereditarily nonparadoxical sets.
Arch. Math. Log.
Péter Komjáth
2015 J jnl
A note on uncountable chordal graphs.
Discret. Math.
Péter Komjáth
2013 J jnl
Note on the point character of
Period. Math. Hung.
Christian Avart, Péter Komjáth, Vojtech Rödl
2013 — ch.
Set Theory: Geometric and Real.
The Mathematics of Paul Erdős II
Péter Komjáth
2011 J jnl
The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces.
Discret. Comput. Geom.
Péter Komjáth
2011 J jnl
The chromatic number of infinite graphs - A survey.
Discret. Math.
Péter Komjáth
2011 J jnl
The quasi order of graphs on an ordinal.
Discret. Math.
Péter Komjáth, Jean A. Larson, Norbert Sauer
2008 J jnl
Colorful Flowers.
Electron. Notes Discret. Math.
Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl
2008 J jnl
Ultrafilters.
Am. Math. Mon.
Péter Komjáth, Vilmos Totik
2005 J jnl
Finite subgraphs of uncountably chromatic graphs.
J. Graph Theory
Péter Komjáth, Saharon Shelah
2005 J jnl
The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah.
J. Math. Log.
Matthew Foreman, Péter Komjáth
2004 J jnl
Wild edge colourings of graphs.
J. Symb. Log.
Mirna Dzamonja, Péter Komjáth, Charles Morgan
2003 J jnl
A Partition Theorem for Scattered Order Types.
Comb. Probab. Comput.
Péter Komjáth, Saharon Shelah
2003 J jnl
Some Remarks on the Simultaneous Chromatic Number.
Comb.
András Hajnal, Péter Komjáth
2002 J jnl
The Two Points Theorem of Mazurkiewicz.
J. Comb. Theory A
Péter Komjáth, James H. Schmerl
2001 J jnl
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems.
Comb.
Péter Komjáth
2001 J jnl
Three clouds may cover the plane.
Ann. Pure Appl. Log.
Péter Komjáth
2000 J jnl
Two Consistency Results on Set Mappings.
J. Symb. Log.
Péter Komjáth, Saharon Shelah
1999 J jnl
Some Remarks on the Partition Calculus of Ordinals.
J. Symb. Log.
Péter Komjáth
1999 J jnl
Some remarks on universal graphs.
Discret. Math.
Péter Komjáth
1999 — conf
Subgraph chromatic number.
Set Theory: The Hajnal Conference
Péter Komjáth
1997 J jnl
A Strongly Non-Ramsey Order Type.
Comb.
András Hajnal, Péter Komjáth
1997 J jnl
Nonexistence of Universal Graphs Without Some Trees.
Comb.
Zoltán Füredi, Péter Komjáth
1997 J jnl
On the existence of countable universal graphs.
J. Graph Theory
Zoltán Füredi, Péter Komjáth
1997 J jnl
Two Remarks on the Coloring Number.
J. Comb. Theory B
Péter Komjáth
1995 J jnl
Universal Graphs without Large Cliques.
J. Comb. Theory B
Péter Komjáth, Saharon Shelah
1994 J jnl
On a Conjecture of Rödl and Voigt.
J. Comb. Theory B
Péter Komjáth, E. C. Milner
1994 J jnl
The Complexity of a Class of Infinite Graphs.
Comb.
Péter Komjáth, János Pach
1994 J jnl
There is no universal countable pentagon-free graph.
J. Graph Theory
Gregory L. Cherlin, Péter Komjáth
1992 J jnl
Martin's axiom and spanning trees of infinite graphs.
J. Comb. Theory B
Péter Komjáth
1991 J jnl
A Set Mapping with No Infinite Free Subsets.
J. Symb. Log.
Péter Komjáth
1991 J jnl
Universal elements and the complexity of certain classes of infinite graphs.
Discret. Math.
Péter Komjáth, János Pach
1990 J jnl
Countable Decompositions of R
Discret. Comput. Geom.
Paul Erdös, Péter Komjáth
1989 J jnl
Set Systems with Finite Chromatic Number.
Eur. J. Comb.
Péter Komjáth
1988 J jnl
A compactness theorem for perfect matchings in matroids.
J. Comb. Theory B
Péter Komjáth, E. C. Milner, Norbert Polat
1988 J jnl
A simplified construction of nonlinear Davenport-Schinzel sequences.
J. Comb. Theory A
Péter Komjáth
1988 J jnl
Forcing Constructions for Uncountably Chromatic Graphs.
J. Symb. Log.
Péter Komjáth, Saharon Shelah
1987 J jnl
Morasses and the Levy-Collapse.
J. Symb. Log.
Péter Komjáth
1987 J jnl
On
J. Comb. Theory A
Ron Aharoni, Péter Komjáth
1987 J jnl
Ramsey-type results for metric spaces.
J. Comb. Theory A
Péter Komjáth
1987 J jnl
Some higher-gap examples in combinatorial set theory.
Ann. Pure Appl. Log.
András Hajnal, Péter Komjáth
1986 J jnl
An infinite version of Ryser's inequality.
J. Comb. Theory A
Péter Komjáth
1986 J jnl
Coloring graphs with locally few colors.
Discret. Math.
Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
1986 J jnl
Coloring of universal graphs.
Graphs Comb.
Péter Komjáth, Vojtech Rödl
1986 J jnl
Stationary Reflection for Uncountable Cofinality.
J. Symb. Log.
Péter Komjáth
1985 — conf
Orientation problems on sequences by recursive functions.
Mathematical Methods of Specification and Synthesis of Software Systems
Péter Komjáth, Zsolt Mihály Szabó
1984 J jnl
What must and what need not be contained in a graph of uncountable chromatic number?.
Comb.
András Hajnal, Péter Komjáth