| 2008 |
|---|
| 31 | EE | Christian Avart,
Péter Komjáth,
Tomasz Luczak,
Vojtech Rödl:
Colorful Flowers.
Electronic Notes in Discrete Mathematics 31: 255-258 (2008) |
| 2005 |
|---|
| 30 | EE | Péter Komjáth,
Saharon Shelah:
Finite subgraphs of uncountably chromatic graphs.
Journal of Graph Theory 49(1): 28-38 (2005) |
| 2003 |
|---|
| 29 | EE | András Hajnal,
Péter Komjáth:
Some Remarks on the Simultaneous Chromatic Number.
Combinatorica 23(1): 89-104 (2003) |
| 28 | | Péter Komjáth,
Saharon Shelah:
A Partition Theorem for Scattered Order Types.
Combinatorics, Probability & Computing 12(5-6): 621-626 (2003) |
| 2002 |
|---|
| 27 | EE | Péter Komjáth,
James H. Schmerl:
The Two Points Theorem of Mazurkiewicz.
J. Comb. Theory, Ser. A 99(2): 371-376 (2002) |
| 2001 |
|---|
| 26 | | Péter Komjáth:
Three clouds may cover the plane.
Ann. Pure Appl. Logic 109(1-2): 71-75 (2001) |
| 25 | EE | Péter Komjáth:
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems.
Combinatorica 21(2): 233-238 (2001) |
| 2000 |
|---|
| 24 | | Péter Komjáth,
Saharon Shelah:
Two Consistency Results on Set Mappings.
J. Symb. Log. 65(1): 333-338 (2000) |
| 1999 |
|---|
| 23 | EE | Péter Komjáth:
Some remarks on universal graphs.
Discrete Mathematics 199(1-3): 259-265 (1999) |
| 22 | | Péter Komjáth:
Some Remarks on the Partition Calculus of Ordinals.
J. Symb. Log. 64(2): 436-442 (1999) |
| 1997 |
|---|
| 21 | | Zoltán Füredi,
Péter Komjáth:
Nonexistence of Universal Graphs Without Some Trees.
Combinatorica 17(2): 163-171 (1997) |
| 20 | | H. Hajnal,
Péter Komjáth:
A Strongly Non-Ramsey Order Type.
Combinatorica 17(3): 363-367 (1997) |
| 19 | EE | Péter Komjáth:
Two Remarks on the Coloring Number.
J. Comb. Theory, Ser. B 70(2): 301-305 (1997) |
| 1995 |
|---|
| 18 | EE | Péter Komjáth,
Saharon Shelah:
Universal Graphs without Large Cliques.
J. Comb. Theory, Ser. B 63(1): 125-135 (1995) |
| 1994 |
|---|
| 17 | | Péter Komjáth,
János Pach:
The Complexity of a Class of Infinite Graphs.
Combinatorica 14(1): 121-125 (1994) |
| 16 | EE | Péter Komjáth,
E. C. Milner:
On a Conjecture of Rödl and Voigt.
J. Comb. Theory, Ser. B 61(2): 199-209 (1994) |
| 1992 |
|---|
| 15 | EE | Péter Komjáth:
Martin's axiom and spanning trees of infinite graphs.
J. Comb. Theory, Ser. B 56(1): 141-144 (1992) |
| 1991 |
|---|
| 14 | EE | Péter Komjáth,
János Pach:
Universal elements and the complexity of certain classes of infinite graphs.
Discrete Mathematics 95(1-3): 255-270 (1991) |
| 13 | | Péter Komjáth:
A Set Mapping with No Infinite Free Subsets.
J. Symb. Log. 56(4): 1400-1402 (1991) |
| 1990 |
|---|
| 12 | | Paul Erdös,
Péter Komjáth:
Countable Decompositions of R2 and R3.
Discrete & Computational Geometry 5: 325-331 (1990) |
| 1988 |
|---|
| 11 | EE | Péter Komjáth:
A simplified construction of nonlinear Davenport-Schinzel sequences.
J. Comb. Theory, Ser. A 49(2): 262-267 (1988) |
| 10 | EE | Péter Komjáth,
E. C. Milner,
Norbert Polat:
A compactness theorem for perfect matchings in matroids.
J. Comb. Theory, Ser. B 44(3): 253-262 (1988) |
| 9 | | Péter Komjáth,
Saharon Shelah:
Forcing Constructions for Uncountably Chromatic Graphs.
J. Symb. Log. 53(3): 696-707 (1988) |
| 1987 |
|---|
| 8 | EE | Ron Aharoni,
Péter Komjáth:
On k-transversals.
J. Comb. Theory, Ser. A 45(1): 1-7 (1987) |
| 7 | EE | Péter Komjáth:
Ramsey-type results for metric spaces.
J. Comb. Theory, Ser. A 45(2): 323-328 (1987) |
| 6 | | Péter Komjáth:
Morasses and the Levy-Collapse.
J. Symb. Log. 52(1): 111-115 (1987) |
| 1986 |
|---|
| 5 | EE | 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.
Discrete Mathematics 59(1-2): 21-34 (1986) |
| 4 | EE | Péter Komjáth:
An infinite version of Ryser's inequality.
J. Comb. Theory, Ser. A 43(2): 329-330 (1986) |
| 3 | | Péter Komjáth:
Stationary Reflection for Uncountable Cofinality.
J. Symb. Log. 51(1): 147-151 (1986) |
| 1985 |
|---|
| 2 | | 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: 201-206 |
| 1984 |
|---|
| 1 | | András Hajnal,
Péter Komjáth:
What must and what need not be contained in a graph of uncountable chromatic number?.
Combinatorica 4(1): 47-52 (1984) |
