default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Péter Komjáth
@article{DBLP:journals/dcg/Komjath24,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Corrigendum to "Countable Decompositions of R\({}^{\mbox{2}}\)
and R\({}^{\mbox{3}}\)"},
journal = {Discret. Comput. Geom.},
volume = {71},
number = {3},
pages = {1165},
year = {2024},
url = {https://doi.org/10.1007/s00454-023-00542-9},
doi = {10.1007/S00454-023-00542-9},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/Komjath24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Komjath21,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Notes on some ERD{\H{o}}S-Hajnal Problems},
journal = {J. Symb. Log.},
volume = {86},
number = {3},
pages = {1116--1123},
year = {2021},
url = {https://doi.org/10.1017/jsl.2021.56},
doi = {10.1017/JSL.2021.56},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/Komjath21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Komjath20,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Constructions of infinite graphs with Ramsey property},
journal = {J. Graph Theory},
volume = {94},
number = {4},
pages = {499--508},
year = {2020},
url = {https://doi.org/10.1002/jgt.22539},
doi = {10.1002/JGT.22539},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Komjath20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BowlerCKR19,
author = {Nathan J. Bowler and
Johannes Carmesin and
P{\'{e}}ter Komj{\'{a}}th and
Christian Reiher},
title = {The Colouring Number of Infinite Graphs},
journal = {Comb.},
volume = {39},
number = {6},
pages = {1225--1235},
year = {2019},
url = {https://doi.org/10.1007/s00493-019-4045-9},
doi = {10.1007/S00493-019-4045-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BowlerCKR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath19,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Minimal covering sets for infinite set systems},
journal = {Discret. Math.},
volume = {342},
number = {6},
pages = {1849--1856},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2019.03.007},
doi = {10.1016/J.DISC.2019.03.007},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KomjathS19,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {Universal graphs omitting finitely many finite graphs},
journal = {Discret. Math.},
volume = {342},
number = {12},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2019.111596},
doi = {10.1016/J.DISC.2019.111596},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KomjathS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Komjath18,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Note {A} Ramsey Statement for Infinite Groups},
journal = {Comb.},
volume = {38},
number = {4},
pages = {1017--1020},
year = {2018},
url = {https://doi.org/10.1007/s00493-016-3706-1},
doi = {10.1007/S00493-016-3706-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Komjath18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath18,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A Ramsey theorem for metric spaces},
journal = {Discret. Math.},
volume = {341},
number = {10},
pages = {2720--2722},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.06.022},
doi = {10.1016/J.DISC.2018.06.022},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/KarolyiK17,
author = {Gyula K{\'{a}}rolyi and
P{\'{e}}ter Komj{\'{a}}th},
title = {Well Ordering Groups with no Monotone Arithmetic Progressions},
journal = {Order},
volume = {34},
number = {2},
pages = {299--306},
year = {2017},
url = {https://doi.org/10.1007/s11083-016-9400-5},
doi = {10.1007/S11083-016-9400-5},
timestamp = {Mon, 10 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/KarolyiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Komjath16,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A remark on hereditarily nonparadoxical sets},
journal = {Arch. Math. Log.},
volume = {55},
number = {1-2},
pages = {165--175},
year = {2016},
url = {https://doi.org/10.1007/s00153-015-0463-6},
doi = {10.1007/S00153-015-0463-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Komjath16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Komjath16,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A problem of Laczkovich: How dense are set systems with no large independent
sets?},
journal = {Ann. Pure Appl. Log.},
volume = {167},
number = {10},
pages = {879--896},
year = {2016},
url = {https://doi.org/10.1016/j.apal.2015.09.004},
doi = {10.1016/J.APAL.2015.09.004},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Komjath16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath15,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A note on uncountable chordal graphs},
journal = {Discret. Math.},
volume = {338},
number = {9},
pages = {1565--1566},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.03.022},
doi = {10.1016/J.DISC.2015.03.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/AvartKR13,
author = {Christian Avart and
P{\'{e}}ter Komj{\'{a}}th and
Vojtech R{\"{o}}dl},
title = {Note on the point character of \emph{l} \({}_{\mbox{1}}\)-spaces},
journal = {Period. Math. Hung.},
volume = {66},
number = {2},
pages = {181--192},
year = {2013},
url = {https://doi.org/10.1007/s10998-013-8845-1},
doi = {10.1007/S10998-013-8845-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pmh/AvartKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/Komjath13,
author = {P{\'{e}}ter Komj{\'{a}}th},
editor = {Ronald L. Graham and
Jaroslav Nesetril and
Steve Butler},
title = {Set Theory: Geometric and Real},
booktitle = {The Mathematics of Paul Erd{\H{o}}s {II}},
pages = {419--425},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-1-4614-7254-4\_24},
doi = {10.1007/978-1-4614-7254-4\_24},
timestamp = {Fri, 02 Nov 2018 09:27:02 +0100},
biburl = {https://dblp.org/rec/books/daglib/p/Komjath13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Komjath11,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {The List-Chromatic Number of Infinite Graphs Defined on Euclidean
Spaces},
journal = {Discret. Comput. Geom.},
volume = {45},
number = {3},
pages = {497--502},
year = {2011},
url = {https://doi.org/10.1007/s00454-009-9228-5},
doi = {10.1007/S00454-009-9228-5},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Komjath11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath11,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {The chromatic number of infinite graphs - {A} survey},
journal = {Discret. Math.},
volume = {311},
number = {15},
pages = {1448--1450},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.11.004},
doi = {10.1016/J.DISC.2010.11.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KomjathLS11,
author = {P{\'{e}}ter Komj{\'{a}}th and
Jean A. Larson and
Norbert Sauer},
title = {The quasi order of graphs on an ordinal},
journal = {Discret. Math.},
volume = {311},
number = {15},
pages = {1451--1460},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.12.006},
doi = {10.1016/J.DISC.2010.12.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KomjathLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AvartKLR08,
author = {Christian Avart and
P{\'{e}}ter Komj{\'{a}}th and
Tomasz Luczak and
Vojtech R{\"{o}}dl},
title = {Colorful Flowers},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {255--258},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.052},
doi = {10.1016/J.ENDM.2008.06.052},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AvartKLR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/KomjathT08,
author = {P{\'{e}}ter Komj{\'{a}}th and
Vilmos Totik},
title = {Ultrafilters},
journal = {Am. Math. Mon.},
volume = {115},
number = {1},
pages = {33--44},
year = {2008},
url = {http://www.jstor.org/stable/27642389},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/KomjathT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KomjathS05,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {Finite subgraphs of uncountably chromatic graphs},
journal = {J. Graph Theory},
volume = {49},
number = {1},
pages = {28--38},
year = {2005},
url = {https://doi.org/10.1002/jgt.20060},
doi = {10.1002/JGT.20060},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KomjathS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jml/0001K05,
author = {Matthew Foreman and
P{\'{e}}ter Komj{\'{a}}th},
title = {The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah},
journal = {J. Math. Log.},
volume = {5},
number = {1},
year = {2005},
url = {https://doi.org/10.1142/S0219061305000419},
doi = {10.1142/S0219061305000419},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jml/0001K05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/DzamonjaKM04,
author = {Mirna Dzamonja and
P{\'{e}}ter Komj{\'{a}}th and
Charles Morgan},
title = {Wild edge colourings of graphs},
journal = {J. Symb. Log.},
volume = {69},
number = {1},
pages = {255--264},
year = {2004},
url = {https://doi.org/10.2178/jsl/1080938840},
doi = {10.2178/JSL/1080938840},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/DzamonjaKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajnalK03,
author = {Andr{\'{a}}s Hajnal and
P{\'{e}}ter Komj{\'{a}}th},
title = {Some Remarks on the Simultaneous Chromatic Number},
journal = {Comb.},
volume = {23},
number = {1},
pages = {89--104},
year = {2003},
url = {https://doi.org/10.1007/s00493-003-0015-2},
doi = {10.1007/S00493-003-0015-2},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KomjathS03,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {A Partition Theorem for Scattered Order Types},
journal = {Comb. Probab. Comput.},
volume = {12},
number = {5-6},
pages = {621--626},
year = {2003},
url = {https://doi.org/10.1017/S0963548303005686},
doi = {10.1017/S0963548303005686},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KomjathS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KomjathS02,
author = {P{\'{e}}ter Komj{\'{a}}th and
James H. Schmerl},
title = {The Two Points Theorem of Mazurkiewicz},
journal = {J. Comb. Theory {A}},
volume = {99},
number = {2},
pages = {371--376},
year = {2002},
url = {https://doi.org/10.1006/jcta.2002.3278},
doi = {10.1006/JCTA.2002.3278},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KomjathS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Komjath01,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Three clouds may cover the plane},
journal = {Ann. Pure Appl. Log.},
volume = {109},
number = {1-2},
pages = {71--75},
year = {2001},
url = {https://doi.org/10.1016/S0168-0072(01)00042-2},
doi = {10.1016/S0168-0072(01)00042-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Komjath01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Komjath01,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple
Systems},
journal = {Comb.},
volume = {21},
number = {2},
pages = {233--238},
year = {2001},
url = {https://doi.org/10.1007/s004930100021},
doi = {10.1007/S004930100021},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Komjath01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KomjathS00,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {Two Consistency Results on Set Mappings},
journal = {J. Symb. Log.},
volume = {65},
number = {1},
pages = {333--338},
year = {2000},
url = {https://doi.org/10.2307/2586540},
doi = {10.2307/2586540},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/KomjathS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath99,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Some remarks on universal graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {259--265},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00339-2},
doi = {10.1016/S0012-365X(98)00339-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Komjath99,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Some Remarks on the Partition Calculus of Ordinals},
journal = {J. Symb. Log.},
volume = {64},
number = {2},
pages = {436--442},
year = {1999},
url = {https://doi.org/10.2307/2586476},
doi = {10.2307/2586476},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Komjath99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Komjath99,
author = {P{\'{e}}ter Komj{\'{a}}th},
editor = {Simon Thomas},
title = {Subgraph chromatic number},
booktitle = {Set Theory: The Hajnal Conference, Proceedings of a {DIMACS} Workshop,
New Brunswick, New Jersey, USA, October 15-17, 1999},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {58},
pages = {99--106},
publisher = {{DIMACS/AMS}},
year = {1999},
url = {https://doi.org/10.1090/dimacs/058/08},
doi = {10.1090/DIMACS/058/08},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Komjath99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FurediK97,
author = {Zolt{\'{a}}n F{\"{u}}redi and
P{\'{e}}ter Komj{\'{a}}th},
title = {Nonexistence of Universal Graphs Without Some Trees},
journal = {Comb.},
volume = {17},
number = {2},
pages = {163--171},
year = {1997},
url = {https://doi.org/10.1007/BF01200905},
doi = {10.1007/BF01200905},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FurediK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajnalK97,
author = {Andr{\'{a}}s Hajnal and
P{\'{e}}ter Komj{\'{a}}th},
title = {A Strongly Non-Ramsey Order Type},
journal = {Comb.},
volume = {17},
number = {3},
pages = {363--367},
year = {1997},
url = {https://doi.org/10.1007/BF01215918},
doi = {10.1007/BF01215918},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Komjath97,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Two Remarks on the Coloring Number},
journal = {J. Comb. Theory {B}},
volume = {70},
number = {2},
pages = {301--305},
year = {1997},
url = {https://doi.org/10.1006/jctb.1997.1760},
doi = {10.1006/JCTB.1997.1760},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Komjath97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FurediK97,
author = {Zolt{\'{a}}n F{\"{u}}redi and
P{\'{e}}ter Komj{\'{a}}th},
title = {On the existence of countable universal graphs},
journal = {J. Graph Theory},
volume = {25},
number = {1},
pages = {53--58},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199705)25:1\&\#60;53::AID-JGT3\&\#62;3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0118(199705)25:1\&\#60;53::AID-JGT3\&\#62;3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FurediK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KomjathS95,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {Universal Graphs without Large Cliques},
journal = {J. Comb. Theory {B}},
volume = {63},
number = {1},
pages = {125--135},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1008},
doi = {10.1006/JCTB.1995.1008},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KomjathS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KomjathP94,
author = {P{\'{e}}ter Komj{\'{a}}th and
J{\'{a}}nos Pach},
title = {The Complexity of a Class of Infinite Graphs},
journal = {Comb.},
volume = {14},
number = {1},
pages = {121--125},
year = {1994},
url = {https://doi.org/10.1007/BF01305955},
doi = {10.1007/BF01305955},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/KomjathP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KomjathM94,
author = {P{\'{e}}ter Komj{\'{a}}th and
E. C. Milner},
title = {On a Conjecture of R{\"{o}}dl and Voigt},
journal = {J. Comb. Theory {B}},
volume = {61},
number = {2},
pages = {199--209},
year = {1994},
url = {https://doi.org/10.1006/jctb.1994.1044},
doi = {10.1006/JCTB.1994.1044},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KomjathM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CherlinK94,
author = {Gregory L. Cherlin and
P{\'{e}}ter Komj{\'{a}}th},
title = {There is no universal countable pentagon-free graph},
journal = {J. Graph Theory},
volume = {18},
number = {4},
pages = {337--341},
year = {1994},
url = {https://doi.org/10.1002/jgt.3190180405},
doi = {10.1002/JGT.3190180405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CherlinK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Komjath92,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Martin's axiom and spanning trees of infinite graphs},
journal = {J. Comb. Theory {B}},
volume = {56},
number = {1},
pages = {141--144},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90013-N},
doi = {10.1016/0095-8956(92)90013-N},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Komjath92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KomjathP91,
author = {P{\'{e}}ter Komj{\'{a}}th and
J{\'{a}}nos Pach},
title = {Universal elements and the complexity of certain classes of infinite
graphs},
journal = {Discret. Math.},
volume = {95},
number = {1-3},
pages = {255--270},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90340-8},
doi = {10.1016/0012-365X(91)90340-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KomjathP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Komjath91,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A Set Mapping with No Infinite Free Subsets},
journal = {J. Symb. Log.},
volume = {56},
number = {4},
pages = {1400--1402},
year = {1991},
url = {https://doi.org/10.2307/2275484},
doi = {10.2307/2275484},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Komjath91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ErdosK90,
author = {Paul Erd{\"{o}}s and
P{\'{e}}ter Komj{\'{a}}th},
title = {Countable Decompositions of R\({}^{\mbox{2}}\) and R\({}^{\mbox{3}}\)},
journal = {Discret. Comput. Geom.},
volume = {5},
pages = {325--331},
year = {1990},
url = {https://doi.org/10.1007/BF02187793},
doi = {10.1007/BF02187793},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/ErdosK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Komjath89,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Set Systems with Finite Chromatic Number},
journal = {Eur. J. Comb.},
volume = {10},
number = {6},
pages = {543--549},
year = {1989},
url = {https://doi.org/10.1016/S0195-6698(89)80071-X},
doi = {10.1016/S0195-6698(89)80071-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Komjath89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KomjathMP88,
author = {P{\'{e}}ter Komj{\'{a}}th and
E. C. Milner and
Norbert Polat},
title = {A compactness theorem for perfect matchings in matroids},
journal = {J. Comb. Theory {B}},
volume = {44},
number = {3},
pages = {253--262},
year = {1988},
url = {https://doi.org/10.1016/0095-8956(88)90035-4},
doi = {10.1016/0095-8956(88)90035-4},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KomjathMP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Komjath88,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {A simplified construction of nonlinear Davenport-Schinzel sequences},
journal = {J. Comb. Theory {A}},
volume = {49},
number = {2},
pages = {262--267},
year = {1988},
url = {https://doi.org/10.1016/0097-3165(88)90055-6},
doi = {10.1016/0097-3165(88)90055-6},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Komjath88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KomjathS88,
author = {P{\'{e}}ter Komj{\'{a}}th and
Saharon Shelah},
title = {Forcing Constructions for Uncountably Chromatic Graphs},
journal = {J. Symb. Log.},
volume = {53},
number = {3},
pages = {696--707},
year = {1988},
url = {https://doi.org/10.2307/2274566},
doi = {10.2307/2274566},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/KomjathS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/HajnalK87,
author = {Andr{\'{a}}s Hajnal and
P{\'{e}}ter Komj{\'{a}}th},
title = {Some higher-gap examples in combinatorial set theory},
journal = {Ann. Pure Appl. Log.},
volume = {33},
pages = {283--296},
year = {1987},
url = {https://doi.org/10.1016/0168-0072(87)90084-4},
doi = {10.1016/0168-0072(87)90084-4},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/HajnalK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AharoniK87,
author = {Ron Aharoni and
P{\'{e}}ter Komj{\'{a}}th},
title = {On \emph{k}-transversals},
journal = {J. Comb. Theory {A}},
volume = {45},
number = {1},
pages = {1--7},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90041-0},
doi = {10.1016/0097-3165(87)90041-0},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/AharoniK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Komjath87,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Ramsey-type results for metric spaces},
journal = {J. Comb. Theory {A}},
volume = {45},
number = {2},
pages = {323--328},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90025-2},
doi = {10.1016/0097-3165(87)90025-2},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Komjath87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Komjath87,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Morasses and the Levy-Collapse},
journal = {J. Symb. Log.},
volume = {52},
number = {1},
pages = {111--115},
year = {1987},
url = {https://doi.org/10.2307/2273865},
doi = {10.2307/2273865},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Komjath87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFHKRS86,
author = {Paul Erd{\"{o}}s and
Zolt{\'{a}}n F{\"{u}}redi and
Andr{\'{a}}s Hajnal and
P{\'{e}}ter Komj{\'{a}}th and
Vojtech R{\"{o}}dl and
{\'{A}}kos Seress},
title = {Coloring graphs with locally few colors},
journal = {Discret. Math.},
volume = {59},
number = {1-2},
pages = {21--34},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90065-8},
doi = {10.1016/0012-365X(86)90065-8},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosFHKRS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KomjathR86,
author = {P{\'{e}}ter Komj{\'{a}}th and
Vojtech R{\"{o}}dl},
title = {Coloring of universal graphs},
journal = {Graphs Comb.},
volume = {2},
number = {1},
pages = {55--60},
year = {1986},
url = {https://doi.org/10.1007/BF01788077},
doi = {10.1007/BF01788077},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KomjathR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Komjath86,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {An infinite version of Ryser's inequality},
journal = {J. Comb. Theory {A}},
volume = {43},
number = {2},
pages = {329--330},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90071-3},
doi = {10.1016/0097-3165(86)90071-3},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Komjath86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Komjath86,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Stationary Reflection for Uncountable Cofinality},
journal = {J. Symb. Log.},
volume = {51},
number = {1},
pages = {147--151},
year = {1986},
url = {https://doi.org/10.2307/2273951},
doi = {10.2307/2273951},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Komjath86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aii/KomjathS85,
author = {P{\'{e}}ter Komj{\'{a}}th and
Zsolt Mih{\'{a}}ly Szab{\'{o}}},
editor = {Wolfgang Bibel and
Klaus P. Jantke},
title = {Orientation problems on sequences by recursive functions},
booktitle = {Mathematical Methods of Specification and Synthesis of Software Systems
'85, Proceedings of the International Spring School, Wendisch-Rietz,
GDR, April 22-26, 1985},
series = {Lecture Notes in Computer Science},
volume = {215},
pages = {201--206},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/3-540-16444-8\_17},
doi = {10.1007/3-540-16444-8\_17},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/aii/KomjathS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajnalK84,
author = {Andr{\'{a}}s Hajnal and
P{\'{e}}ter Komj{\'{a}}th},
title = {What must and what need not be contained in a graph of uncountable
chromatic number?},
journal = {Comb.},
volume = {4},
number = {1},
pages = {47--52},
year = {1984},
url = {https://doi.org/10.1007/BF02579156},
doi = {10.1007/BF02579156},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-06-10 21:27 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:
