Péter Komjáth Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Ron Aharoni [8]
2Christian Avart [31]
3Paul Erdös [5] [12]
4Zoltán Füredi [5] [21]
5András Hajnal [1] [5] [29]
6H. Hajnal [20]
7Tomasz Luczak [31]
8E. C. Milner [10] [16]
9János Pach [14] [17]
10Norbert Polat [10]
11Vojtech Rödl [5] [31]
12James H. Schmerl [27]
13Ákos Seress [5]
14Saharon Shelah [9] [18] [24] [28] [30]
15Zsolt Mihály Szabó [2]

Colors in the list of coauthors

Copyright © Mon Nov 30 15:58:31 2009 by Michael Ley (ley@uni-trier.de)