default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Komjáth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j54]Péter Komjáth
:
Corrigendum to "Countable Decompositions of R2 and R3". Discret. Comput. Geom. 71(3): 1165 (2024)- 2021
- [j53]Péter Komjáth:
Notes on some ERDőS-Hajnal Problems. J. Symb. Log. 86(3): 1116-1123 (2021) - 2020
- [j52]Péter Komjáth:
Constructions of infinite graphs with Ramsey property. J. Graph Theory 94(4): 499-508 (2020)
2010 – 2019
- 2019
- [j51]Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher:
The Colouring Number of Infinite Graphs. Comb. 39(6): 1225-1235 (2019) - [j50]Péter Komjáth:
Minimal covering sets for infinite set systems. Discret. Math. 342(6): 1849-1856 (2019) - [j49]Péter Komjáth, Saharon Shelah:
Universal graphs omitting finitely many finite graphs. Discret. Math. 342(12) (2019) - 2018
- [j48]Péter Komjáth:
Note A Ramsey Statement for Infinite Groups. Comb. 38(4): 1017-1020 (2018) - [j47]Péter Komjáth:
A Ramsey theorem for metric spaces. Discret. Math. 341(10): 2720-2722 (2018) - 2017
- [j46]Gyula Károlyi, Péter Komjáth:
Well Ordering Groups with no Monotone Arithmetic Progressions. Order 34(2): 299-306 (2017) - 2016
- [j45]Péter Komjáth:
A remark on hereditarily nonparadoxical sets. Arch. Math. Log. 55(1-2): 165-175 (2016) - [j44]Péter Komjáth:
A problem of Laczkovich: How dense are set systems with no large independent sets? Ann. Pure Appl. Log. 167(10): 879-896 (2016) - 2015
- [j43]Péter Komjáth:
A note on uncountable chordal graphs. Discret. Math. 338(9): 1565-1566 (2015) - 2013
- [j42]Christian Avart, Péter Komjáth, Vojtech Rödl:
Note on the point character of l 1-spaces. Period. Math. Hung. 66(2): 181-192 (2013) - [p1]Péter Komjáth:
Set Theory: Geometric and Real. The Mathematics of Paul Erdős II 2013: 419-425 - 2011
- [j41]Péter Komjáth:
The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces. Discret. Comput. Geom. 45(3): 497-502 (2011) - [j40]Péter Komjáth:
The chromatic number of infinite graphs - A survey. Discret. Math. 311(15): 1448-1450 (2011) - [j39]Péter Komjáth, Jean A. Larson, Norbert Sauer:
The quasi order of graphs on an ordinal. Discret. Math. 311(15): 1451-1460 (2011)
2000 – 2009
- 2008
- [j38]Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl:
Colorful Flowers. Electron. Notes Discret. Math. 31: 255-258 (2008) - [j37]Péter Komjáth, Vilmos Totik:
Ultrafilters. Am. Math. Mon. 115(1): 33-44 (2008) - 2005
- [j36]Péter Komjáth, Saharon Shelah:
Finite subgraphs of uncountably chromatic graphs. J. Graph Theory 49(1): 28-38 (2005) - [j35]Matthew Foreman, Péter Komjáth:
The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah. J. Math. Log. 5(1) (2005) - 2004
- [j34]Mirna Dzamonja, Péter Komjáth, Charles Morgan:
Wild edge colourings of graphs. J. Symb. Log. 69(1): 255-264 (2004) - 2003
- [j33]András Hajnal, Péter Komjáth:
Some Remarks on the Simultaneous Chromatic Number. Comb. 23(1): 89-104 (2003) - [j32]Péter Komjáth, Saharon Shelah:
A Partition Theorem for Scattered Order Types. Comb. Probab. Comput. 12(5-6): 621-626 (2003) - 2002
- [j31]Péter Komjáth, James H. Schmerl:
The Two Points Theorem of Mazurkiewicz. J. Comb. Theory A 99(2): 371-376 (2002) - 2001
- [j30]Péter Komjáth:
Three clouds may cover the plane. Ann. Pure Appl. Log. 109(1-2): 71-75 (2001) - [j29]Péter Komjáth:
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems. Comb. 21(2): 233-238 (2001) - 2000
- [j28]Péter Komjáth, Saharon Shelah:
Two Consistency Results on Set Mappings. J. Symb. Log. 65(1): 333-338 (2000)
1990 – 1999
- 1999
- [j27]Péter Komjáth:
Some remarks on universal graphs. Discret. Math. 199(1-3): 259-265 (1999) - [j26]Péter Komjáth:
Some Remarks on the Partition Calculus of Ordinals. J. Symb. Log. 64(2): 436-442 (1999) - [c2]Péter Komjáth:
Subgraph chromatic number. Set Theory: The Hajnal Conference 1999: 99-106 - 1997
- [j25]Zoltán Füredi, Péter Komjáth:
Nonexistence of Universal Graphs Without Some Trees. Comb. 17(2): 163-171 (1997) - [j24]András Hajnal, Péter Komjáth:
A Strongly Non-Ramsey Order Type. Comb. 17(3): 363-367 (1997) - [j23]Péter Komjáth:
Two Remarks on the Coloring Number. J. Comb. Theory B 70(2): 301-305 (1997) - [j22]Zoltán Füredi, Péter Komjáth:
On the existence of countable universal graphs. J. Graph Theory 25(1): 53-58 (1997) - 1995
- [j21]Péter Komjáth, Saharon Shelah:
Universal Graphs without Large Cliques. J. Comb. Theory B 63(1): 125-135 (1995) - 1994
- [j20]Péter Komjáth, János Pach:
The Complexity of a Class of Infinite Graphs. Comb. 14(1): 121-125 (1994) - [j19]Péter Komjáth, E. C. Milner:
On a Conjecture of Rödl and Voigt. J. Comb. Theory B 61(2): 199-209 (1994) - [j18]Gregory L. Cherlin, Péter Komjáth:
There is no universal countable pentagon-free graph. J. Graph Theory 18(4): 337-341 (1994) - 1992
- [j17]Péter Komjáth:
Martin's axiom and spanning trees of infinite graphs. J. Comb. Theory B 56(1): 141-144 (1992) - 1991
- [j16]Péter Komjáth, János Pach:
Universal elements and the complexity of certain classes of infinite graphs. Discret. Math. 95(1-3): 255-270 (1991) - [j15]Péter Komjáth:
A Set Mapping with No Infinite Free Subsets. J. Symb. Log. 56(4): 1400-1402 (1991) - 1990
- [j14]Paul Erdös, Péter Komjáth:
Countable Decompositions of R2 and R3. Discret. Comput. Geom. 5: 325-331 (1990)
1980 – 1989
- 1989
- [j13]Péter Komjáth:
Set Systems with Finite Chromatic Number. Eur. J. Comb. 10(6): 543-549 (1989) - 1988
- [j12]Péter Komjáth, E. C. Milner, Norbert Polat:
A compactness theorem for perfect matchings in matroids. J. Comb. Theory B 44(3): 253-262 (1988) - [j11]Péter Komjáth:
A simplified construction of nonlinear Davenport-Schinzel sequences. J. Comb. Theory A 49(2): 262-267 (1988) - [j10]Péter Komjáth, Saharon Shelah:
Forcing Constructions for Uncountably Chromatic Graphs. J. Symb. Log. 53(3): 696-707 (1988) - 1987
- [j9]András Hajnal, Péter Komjáth:
Some higher-gap examples in combinatorial set theory. Ann. Pure Appl. Log. 33: 283-296 (1987) - [j8]Ron Aharoni, Péter Komjáth:
On k-transversals. J. Comb. Theory A 45(1): 1-7 (1987) - [j7]Péter Komjáth:
Ramsey-type results for metric spaces. J. Comb. Theory A 45(2): 323-328 (1987) - [j6]Péter Komjáth:
Morasses and the Levy-Collapse. J. Symb. Log. 52(1): 111-115 (1987) - 1986
- [j5]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): 21-34 (1986) - [j4]Péter Komjáth, Vojtech Rödl:
Coloring of universal graphs. Graphs Comb. 2(1): 55-60 (1986) - [j3]Péter Komjáth:
An infinite version of Ryser's inequality. J. Comb. Theory A 43(2): 329-330 (1986) - [j2]Péter Komjáth:
Stationary Reflection for Uncountable Cofinality. J. Symb. Log. 51(1): 147-151 (1986) - 1985
- [c1]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
- [j1]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): 47-52 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
