Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Hladký
@article{DBLP:journals/rsa/AraujoHHS24,
author = {Pedro Ara{\'{u}}jo and
Jan Hladk{\'{y}} and
Eng Keat Hng and
Matas Sileikis},
title = {Prominent examples of flip processes},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {692--740},
year = {2024},
url = {https://doi.org/10.1002/rsa.21192},
doi = {10.1002/RSA.21192},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AraujoHHS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HladkyH23,
author = {Jan Hladk{\'{y}} and
Eng Keat Hng},
title = {Approximating fractionally isomorphic graphons},
journal = {Eur. J. Comb.},
volume = {113},
pages = {103751},
year = {2023},
url = {https://doi.org/10.1016/j.ejc.2023.103751},
doi = {10.1016/J.EJC.2023.103751},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HladkyH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/GarbeHL22,
author = {Frederik Garbe and
Jan Hladk{\'{y}} and
Joonkyung Lee},
title = {Two Remarks on Graph Norms},
journal = {Discret. Comput. Geom.},
volume = {67},
number = {3},
pages = {919--929},
year = {2022},
url = {https://doi.org/10.1007/s00454-021-00280-w},
doi = {10.1007/S00454-021-00280-W},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/GarbeHL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/DolezalGHRR22,
author = {Martin Dolezal and
Jan Greb{\'{\i}}k and
Jan Hladk{\'{y}} and
Israel Rocha and
V{\'{a}}clav Rozhon},
title = {Cut distance identifying graphon parameters over weak* limits},
journal = {J. Comb. Theory, Ser. {A}},
volume = {189},
pages = {105615},
year = {2022},
url = {https://doi.org/10.1016/j.jcta.2022.105615},
doi = {10.1016/J.JCTA.2022.105615},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/DolezalGHRR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DolezalHKMPV21,
author = {Martin Dolezal and
Jan Hladk{\'{y}} and
Jan Kol{\'{a}}r and
Themis Mitsis and
Christos Pelekis and
V{\'{a}}clav Vlas{\'{a}}k},
title = {A Tur{\'{a}}n-Type Theorem for Large-Distance Graphs in Euclidean
Spaces, and Related Isodiametric Problems},
journal = {Discret. Comput. Geom.},
volume = {66},
number = {1},
pages = {281--300},
year = {2021},
url = {https://doi.org/10.1007/s00454-020-00183-2},
doi = {10.1007/S00454-020-00183-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/DolezalHKMPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HladkyHP21,
author = {Jan Hladk{\'{y}} and
Ping Hu and
Diana Piguet},
title = {Tilings in graphons},
journal = {Eur. J. Comb.},
volume = {93},
pages = {103284},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2020.103284},
doi = {10.1016/J.EJC.2020.103284},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HladkyHP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/DolezalGHRR21,
author = {Martin Dolezal and
Jan Greb{\'{\i}}k and
Jan Hladk{\'{y}} and
Israel Rocha and
V{\'{a}}clav Rozhon},
title = {Relating the cut distance and the weak* topology for graphons},
journal = {J. Comb. Theory, Ser. {B}},
volume = {147},
pages = {252--298},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2020.04.003},
doi = {10.1016/J.JCTB.2020.04.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/DolezalGHRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HladkyPS21,
author = {Jan Hladk{\'{y}} and
Christos Pelekis and
Matas Sileikis},
title = {A limit theorem for small cliques in inhomogeneous random graphs},
journal = {J. Graph Theory},
volume = {97},
number = {4},
pages = {578--599},
year = {2021},
url = {https://doi.org/10.1002/jgt.22673},
doi = {10.1002/JGT.22673},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HladkyPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HladkyR20,
author = {Jan Hladk{\'{y}} and
Israel Rocha},
title = {Independent sets, cliques, and colorings in graphons},
journal = {Eur. J. Comb.},
volume = {88},
pages = {103108},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103108},
doi = {10.1016/J.EJC.2020.103108},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HladkyR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AdamaszekAGH20,
author = {Anna Adamaszek and
Peter Allen and
Codrut Grosu and
Jan Hladk{\'{y}}},
title = {Almost all trees are almost graceful},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {948--987},
year = {2020},
url = {https://doi.org/10.1002/rsa.20906},
doi = {10.1002/RSA.20906},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AdamaszekAGH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/DolezalH19,
author = {Martin Dolezal and
Jan Hladk{\'{y}}},
title = {Matching Polytons},
journal = {Electron. J. Comb.},
volume = {26},
number = {4},
pages = {4},
year = {2019},
url = {https://doi.org/10.37236/6241},
doi = {10.37236/6241},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/DolezalH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DolezalH19,
author = {Martin Dolezal and
Jan Hladk{\'{y}}},
title = {Cut-norm and entropy minimization over weak\({}^{\mbox{{\unicode{8270}}}}\)
limits},
journal = {J. Comb. Theory, Ser. {B}},
volume = {137},
pages = {232--263},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.12.010},
doi = {10.1016/J.JCTB.2018.12.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DolezalH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HladkyHP19,
author = {Jan Hladk{\'{y}} and
Ping Hu and
Diana Piguet},
title = {Koml{\'{o}}s's tiling theorem via graphon covers},
journal = {J. Graph Theory},
volume = {90},
number = {1},
pages = {24--45},
year = {2019},
url = {https://doi.org/10.1002/jgt.22365},
doi = {10.1002/JGT.22365},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HladkyHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HladkyKN17,
author = {Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l' and
Sergey Norin},
title = {Counting flags in triangle-free digraphs},
journal = {Comb.},
volume = {37},
number = {1},
pages = {49--76},
year = {2017},
url = {https://doi.org/10.1007/s00493-015-2662-5},
doi = {10.1007/S00493-015-2662-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HladkyKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CsikvariFHH17,
author = {P{\'{e}}ter Csikv{\'{a}}ri and
P{\'{e}}ter E. Frenkel and
Jan Hladk{\'{y}} and
Tam{\'{a}}s Hubai},
title = {Chromatic roots and limits of dense graphs},
journal = {Discret. Math.},
volume = {340},
number = {5},
pages = {1129--1135},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.11.009},
doi = {10.1016/J.DISC.2016.11.009},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CsikvariFHH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AllenBHP17,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {Packing degenerate graphs greedily},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {45--51},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.019},
doi = {10.1016/J.ENDM.2017.06.019},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AllenBHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DolezalHHP17,
author = {Martin Dolezal and
Jan Hladk{\'{y}} and
Ping Hu and
Diana Piguet},
title = {First steps in combinatorial optimization on graphons: Matchings},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {359--365},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.060},
doi = {10.1016/J.ENDM.2017.06.060},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DolezalHHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DolezalHM17,
author = {Martin Dolezal and
Jan Hladk{\'{y}} and
Andr{\'{a}}s M{\'{a}}th{\'{e}}},
title = {Cliques in dense inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {275--314},
year = {2017},
url = {https://doi.org/10.1002/rsa.20715},
doi = {10.1002/RSA.20715},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DolezalHM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyKPSSS17,
author = {Jan Hladk{\'{y}} and
J{\'{a}}nos Koml{\'{o}}s and
Diana Piguet and
Mikl{\'{o}}s Simonovits and
Maya Stein and
Endre Szemer{\'{e}}di},
title = {The Approximate Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture
{I:} The Sparse Decomposition},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {945--982},
year = {2017},
url = {https://doi.org/10.1137/140982842},
doi = {10.1137/140982842},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyKPSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyKPSSS17a,
author = {Jan Hladk{\'{y}} and
J{\'{a}}nos Koml{\'{o}}s and
Diana Piguet and
Mikl{\'{o}}s Simonovits and
Maya Stein and
Endre Szemer{\'{e}}di},
title = {The Approximate Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture
{II:} The Rough Structure of {LKS} Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {983--1016},
year = {2017},
url = {https://doi.org/10.1137/140982854},
doi = {10.1137/140982854},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyKPSSS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyKPSSS17b,
author = {Jan Hladk{\'{y}} and
J{\'{a}}nos Koml{\'{o}}s and
Diana Piguet and
Mikl{\'{o}}s Simonovits and
Maya Stein and
Endre Szemer{\'{e}}di},
title = {The Approximate Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture
{III:} The Finer Structure of {LKS} Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {1017--1071},
year = {2017},
url = {https://doi.org/10.1137/140982866},
doi = {10.1137/140982866},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyKPSSS17b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyKPSSS17c,
author = {Jan Hladk{\'{y}} and
J{\'{a}}nos Koml{\'{o}}s and
Diana Piguet and
Mikl{\'{o}}s Simonovits and
Maya Stein and
Endre Szemer{\'{e}}di},
title = {The Approximate Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture
{IV:} Embedding Techniques and the Proof of the Main Result},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {1072--1148},
year = {2017},
url = {https://doi.org/10.1137/140982878},
doi = {10.1137/140982878},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyKPSSS17c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HladkyP16,
author = {Jan Hladk{\'{y}} and
Diana Piguet},
title = {Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture: Dense case},
journal = {J. Comb. Theory, Ser. {B}},
volume = {116},
pages = {123--190},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2015.07.004},
doi = {10.1016/J.JCTB.2015.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HladkyP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/CibulkaHCW14,
author = {Josef Cibulka and
Jan Hladk{\'{y}} and
Michael A. La Croix and
David G. Wagner},
title = {A Combinatorial Proof Of Rayleigh Monotonicity For Graphs},
journal = {Ars Comb.},
volume = {117},
pages = {333--348},
year = {2014},
timestamp = {Fri, 05 Sep 2014 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/CibulkaHCW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AllenBHP14,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {An Extension of Tur{\'{a}}n's Theorem, Uniqueness and Stability},
journal = {Electron. J. Comb.},
volume = {21},
number = {4},
pages = {4},
year = {2014},
url = {https://doi.org/10.37236/4194},
doi = {10.37236/4194},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AllenBHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChristofidesHM14,
author = {Demetres Christofides and
Jan Hladk{\'{y}} and
Andr{\'{a}}s M{\'{a}}th{\'{e}}},
title = {Hamilton cycles in dense vertex-transitive graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {109},
pages = {34--72},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2014.05.001},
doi = {10.1016/J.JCTB.2014.05.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ChristofidesHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BottcherHPT14,
author = {Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet and
Anusch Taraz},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {An Approximate Version of the Tree Packing Conjecture via Random Embeddings},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {490--499},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.490},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BottcherHPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HatamiHKNR13,
author = {Hamed Hatami and
Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l' and
Serguei Norine and
Alexander A. Razborov},
title = {On the number of pentagons in triangle-free graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {120},
number = {3},
pages = {722--732},
year = {2013},
url = {https://doi.org/10.1016/j.jcta.2012.12.008},
doi = {10.1016/J.JCTA.2012.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HatamiHKNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HladkyKN13,
author = {Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l' and
Serguei Norine},
title = {Rank of divisors on tropical curves},
journal = {J. Comb. Theory, Ser. {A}},
volume = {120},
number = {7},
pages = {1521--1538},
year = {2013},
url = {https://doi.org/10.1016/j.jcta.2013.05.002},
doi = {10.1016/J.JCTA.2013.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HladkyKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBHP13,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {Tur{\'{a}}nnical hypergraphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {29--58},
year = {2013},
url = {https://doi.org/10.1002/rsa.20399},
doi = {10.1002/RSA.20399},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HatamiHKNR12,
author = {Hamed Hatami and
Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l' and
Serguei Norine and
Alexander A. Razborov},
title = {Non-Three-Colourable Common Graphs Exist},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {5},
pages = {734--742},
year = {2012},
url = {https://doi.org/10.1017/S0963548312000107},
doi = {10.1017/S0963548312000107},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HatamiHKNR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GrosuH12,
author = {Codrut Grosu and
Jan Hladk{\'{y}}},
title = {The extremal function for partial bipartite tilings},
journal = {Eur. J. Comb.},
volume = {33},
number = {5},
pages = {807--815},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.026},
doi = {10.1016/J.EJC.2011.09.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GrosuH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BottcherHP12,
author = {Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {The tripartite Ramsey number for trees},
journal = {J. Graph Theory},
volume = {69},
number = {3},
pages = {264--300},
year = {2012},
url = {https://doi.org/10.1002/jgt.20582},
doi = {10.1002/JGT.20582},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BottcherHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AllenBHP11,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {A density Corr{\'{a}}di-Hajnal theorem},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {31--36},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.006},
doi = {10.1016/J.ENDM.2011.09.006},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AllenBHP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChristofidesHM11,
author = {Demetres Christofides and
Jan Hladk{\'{y}} and
Andr{\'{a}}s M{\'{a}}th{\'{e}}},
title = {A proof of the dense version of Lov{\'{a}}sz conjecture},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {285--290},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.047},
doi = {10.1016/J.ENDM.2011.09.047},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/ChristofidesHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/AllenBH11,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}}},
title = {Filling the gap between Tur{\'{a}}n's theorem and P{\'{o}}sa's
conjecture},
journal = {J. Lond. Math. Soc.},
volume = {84},
number = {2},
pages = {269--302},
year = {2011},
url = {https://doi.org/10.1112/jlms/jdr007},
doi = {10.1112/JLMS/JDR007},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/AllenBH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HladkyKS10,
author = {Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l' and
Uwe Schauz},
title = {Brooks' Theorem via the Alon-Tarsi Theorem},
journal = {Discret. Math.},
volume = {310},
number = {23},
pages = {3426--3428},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.07.019},
doi = {10.1016/J.DISC.2010.07.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HladkyKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyS10,
author = {Jan Hladk{\'{y}} and
Mathias Schacht},
title = {Note on Bipartite Graph Tilings},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {2},
pages = {357--362},
year = {2010},
url = {https://doi.org/10.1137/080726434},
doi = {10.1137/080726434},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AllenBHC09,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Oliver Cooley},
title = {Minimum degree conditions for large subgraphs},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {75--79},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.013},
doi = {10.1016/J.ENDM.2009.07.013},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AllenBHC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherHP09,
author = {Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {The tripartite Ramsey number for trees},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {597--601},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.101},
doi = {10.1016/J.ENDM.2009.07.101},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CooleyHP09,
author = {Oliver Cooley and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {Loebl-Koml{\'{o}}s-S{\'{o}}s Conjecture: dense case},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {609--613},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.103},
doi = {10.1016/J.ENDM.2009.07.103},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/CooleyHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HladkyKN09,
author = {Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l and
Sergey Norin},
title = {Counting flags in triangle-free digraphs},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {621--625},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.105},
doi = {10.1016/J.ENDM.2009.07.105},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HladkyKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HladkyKSS08,
author = {Jan Hladk{\'{y}} and
Daniel Kr{\'{a}}l and
Jean{-}S{\'{e}}bastien Sereni and
Michael Stiebitz},
title = {List colorings with measurable sets},
journal = {J. Graph Theory},
volume = {59},
number = {3},
pages = {229--238},
year = {2008},
url = {https://doi.org/10.1002/jgt.20335},
doi = {10.1002/JGT.20335},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HladkyKSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-10 21:29 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:
