Péter Komjáth

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 12

Top Topics

Graph Databases

Definite Clause

Top Venues

Discret. Comput. Geom.

Arch. Math. Log.

Publications

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