| Problems and theorems in classical set theory P Komjáth, V Totik Springer Science & Business Media, 2006 | 97 | 2006 |
| Mathematical Proceedings of the Cambridge Philosophical Society E Goodwin Cambridge University Press, 1939 | 91 | 1939 |
| Coloring graphs with locally few colors P Erdös, Z Füredi, A Hajnal, P Komjáth, V Rödl, A Seress Discrete mathematics 59 (1-2), 21-34, 1986 | 78 | 1986 |
| Coloring of universal graphs P Komjáth, V Rödl Graphs and Combinatorics 2, 55-60, 1986 | 53 | 1986 |
| Some universal graphs P Komjáth, AH Mekler, J Pach Israel Journal of Mathematics 64 (2), 158-168, 1988 | 51 | 1988 |
| Some remarks on universal graphs P Komjáth Discrete mathematics 199 (1-3), 259-265, 1999 | 39 | 1999 |
| There is no universal countable pentagon-free graph H CENTER, B CAMPUS Journal of Graph Theory 18 (4), 337-341, 1994 | 37 | 1994 |
| Universal graphs without large bipartite subgraphs P Komjáth, J Pach Mathematika 31 (2), 282-290, 1984 | 36 | 1984 |
| On the existence of countable universal graphs Z Füredi, P Komjáth Journal of Graph Theory 25 (1), 53-58, 1997 | 35 | 1997 |
| Embedding graphs into colored graphs A Hajnal, P Komjáth Transactions of the American Mathematical Society 307 (1), 395-409, 1988 | 35 | 1988 |
| Large sets not containing images of a given sequence P Komjáth Canadian Mathematical Bulletin 26 (1), 41-43, 1983 | 34 | 1983 |
| Boolean algebras in which every chain and antichain is countable JE Baumgartner, P Komjáth Fund. Math 111 (2), 125-133, 1981 | 34 | 1981 |
| Universal elements and the complexity of certain classes of infinite graphs P Komjáth, J Pach Discrete mathematics 95 (1-3), 255-270, 1991 | 32 | 1991 |
| Countable Decompositions of R2 and R3. P Erdös, P Komjáth Discrete & computational geometry 5 (4), 325-332, 1990 | 30 | 1990 |
| Universal graphs without large cliques P Komjath, S Shelah arXiv preprint math/9308221, 1993 | 29 | 1993 |
| Nonexistence of universal graphs without some trees Z Füredi, P Komjáth Combinatorica 17, 163-171, 1997 | 27 | 1997 |
| Ultrafilters P Komjáth, V Totik The American Mathematical Monthly 115 (1), 33-44, 2008 | 24 | 2008 |
| What must and what need not be contained in a graph of uncountable chromatic number? A Hajnal, P Komjáth Combinatorica 4, 47-52, 1984 | 24 | 1984 |
| A decomposition theorem for 𝑅ⁿ P Komjáth Proceedings of the American Mathematical Society 120 (3), 921-927, 1994 | 21 | 1994 |
| Set theoretic constructions in Euclidean spaces P Komjáth New trends in discrete and computational geometry, 303-325, 1993 | 21 | 1993 |
Paul ErdősMathematics
