The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Péter Komjáth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.032secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002