default search action
BibTeX records: Peter Keevash
@inproceedings{DBLP:conf/icalp/ChenKKPV24, author = {Chung Shue Chen and Peter Keevash and Sean Kennedy and {\'{E}}lie de Panafieu and Adrian Vetta}, editor = {Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson}, title = {Robot Positioning Using Torus Packing for Multisets}, booktitle = {51st International Colloquium on Automata, Languages, and Programming, {ICALP} 2024, July 8-12, 2024, Tallinn, Estonia}, series = {LIPIcs}, volume = {297}, pages = {43:1--43:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.43}, doi = {10.4230/LIPICS.ICALP.2024.43}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChenKKPV24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2404-09981, author = {Chung Shue Chen and Peter Keevash and Sean Kennedy and {\'{E}}lie de Panafieu and Adrian Vetta}, title = {Robot Positioning Using Torus Packing for Multisets}, journal = {CoRR}, volume = {abs/2404.09981}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2404.09981}, doi = {10.48550/ARXIV.2404.09981}, eprinttype = {arXiv}, eprint = {2404.09981}, timestamp = {Wed, 15 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2404-09981.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KeevashS22, author = {Peter Keevash and Katherine Staden}, title = {The generalised Oberwolfach problem}, journal = {J. Comb. Theory {B}}, volume = {152}, pages = {281--318}, year = {2022}, url = {https://doi.org/10.1016/j.jctb.2021.09.007}, doi = {10.1016/J.JCTB.2021.09.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/KeevashS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-12643, author = {Jie Han and Peter Keevash}, title = {Finding matchings in dense hypergraphs}, journal = {CoRR}, volume = {abs/2210.12643}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.12643}, doi = {10.48550/ARXIV.2210.12643}, eprinttype = {arXiv}, eprint = {2210.12643}, timestamp = {Fri, 28 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-12643.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BohmanK21, author = {Tom Bohman and Peter Keevash}, title = {Dynamic concentration of the triangle-free process}, journal = {Random Struct. Algorithms}, volume = {58}, number = {2}, pages = {221--293}, year = {2021}, url = {https://doi.org/10.1002/rsa.20973}, doi = {10.1002/RSA.20973}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/BohmanK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashY20, author = {Peter Keevash and Liana Yepremyan}, title = {On the number of symbols that forces a transversal}, journal = {Comb. Probab. Comput.}, volume = {29}, number = {2}, pages = {234--240}, year = {2020}, url = {https://doi.org/10.1017/S0963548319000282}, doi = {10.1017/S0963548319000282}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/KeevashY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcta/CoulsonKPY20, author = {Matthew Coulson and Peter Keevash and Guillem Perarnau and Liana Yepremyan}, title = {Rainbow factors in hypergraphs}, journal = {J. Comb. Theory {A}}, volume = {172}, pages = {105184}, year = {2020}, url = {https://doi.org/10.1016/j.jcta.2019.105184}, doi = {10.1016/J.JCTA.2019.105184}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcta/CoulsonKPY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KeevashL20, author = {Peter Keevash and Eoin Long}, title = {Stability for vertex isoperimetry in the cube}, journal = {J. Comb. Theory {B}}, volume = {145}, pages = {113--144}, year = {2020}, url = {https://doi.org/10.1016/j.jctb.2020.04.009}, doi = {10.1016/J.JCTB.2020.04.009}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/KeevashL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/ClinchJK20, author = {Katie Clinch and Bill Jackson and Peter Keevash}, title = {Global rigidity of direction-length frameworks}, journal = {J. Comb. Theory {B}}, volume = {145}, pages = {145--168}, year = {2020}, url = {https://doi.org/10.1016/j.jctb.2020.05.003}, doi = {10.1016/J.JCTB.2020.05.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/ClinchJK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/JenssenKP20, author = {Matthew Jenssen and Peter Keevash and Will Perkins}, title = {Algorithms for {\#}BIS-Hard Problems on Expander Graphs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {681--710}, year = {2020}, url = {https://doi.org/10.1137/19M1286669}, doi = {10.1137/19M1286669}, timestamp = {Fri, 08 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/JenssenKP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HanK20, author = {Jie Han and Peter Keevash}, editor = {Shuchi Chawla}, title = {Finding Perfect Matchings in Dense Hypergraphs}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {2366--2377}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.145}, doi = {10.1137/1.9781611975994.145}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/HanK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JenssenKP19, author = {Matthew Jenssen and Peter Keevash and Will Perkins}, editor = {Timothy M. Chan}, title = {Algorithms for {\#}BIS-hard problems on expander graphs}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2235--2247}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.135}, doi = {10.1137/1.9781611975482.135}, timestamp = {Fri, 08 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/JenssenKP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashL18, author = {Peter Keevash and Eoin Long}, title = {A stability result for the cube edge isoperimetric inequality}, journal = {J. Comb. Theory {A}}, volume = {155}, pages = {360--375}, year = {2018}, url = {https://doi.org/10.1016/j.jcta.2017.11.005}, doi = {10.1016/J.JCTA.2017.11.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KeevashY18, author = {Peter Keevash and Liana Yepremyan}, title = {Rainbow Matchings in Properly Colored Multigraphs}, journal = {{SIAM} J. Discret. Math.}, volume = {32}, number = {3}, pages = {1577--1584}, year = {2018}, url = {https://doi.org/10.1137/17M1151742}, doi = {10.1137/17M1151742}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KeevashY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-10911, author = {Peter Keevash and Liana Yepremyan}, title = {On the number of symbols that forces a transversal}, journal = {CoRR}, volume = {abs/1805.10911}, year = {2018}, url = {http://arxiv.org/abs/1805.10911}, eprinttype = {arXiv}, eprint = {1805.10911}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-10911.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-04804, author = {Matthew Jenssen and Peter Keevash and Will Perkins}, title = {Algorithms for {\#}BIS-hard problems on expander graphs}, journal = {CoRR}, volume = {abs/1807.04804}, year = {2018}, url = {http://arxiv.org/abs/1807.04804}, eprinttype = {arXiv}, eprint = {1807.04804}, timestamp = {Fri, 08 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-04804.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashL17, author = {Peter Keevash and William Lochet}, title = {The Structure of Typical Eye-Free Graphs and a Tur{\'{a}}n-Type Result for Two Weighted Colours}, journal = {Comb. Probab. Comput.}, volume = {26}, number = {6}, pages = {886--910}, year = {2017}, url = {https://doi.org/10.1017/S0963548317000293}, doi = {10.1017/S0963548317000293}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KeevashL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BallaDKS17, author = {Igor Balla and Felix Dr{\"{a}}xler and Peter Keevash and Benny Sudakov}, title = {Equiangular lines and subspaces in Euclidean spaces}, journal = {Electron. Notes Discret. Math.}, volume = {61}, pages = {85--91}, year = {2017}, url = {https://doi.org/10.1016/j.endm.2017.06.024}, doi = {10.1016/J.ENDM.2017.06.024}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BallaDKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-03041, author = {Peter Keevash and Liana Yepremyan}, title = {Rainbow matchings in properly-coloured multigraphs}, journal = {CoRR}, volume = {abs/1710.03041}, year = {2017}, url = {http://arxiv.org/abs/1710.03041}, eprinttype = {arXiv}, eprint = {1710.03041}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-03041.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashL16, author = {Peter Keevash and Eoin Long}, title = {On the Normalized Shannon Capacity of a Union}, journal = {Comb. Probab. Comput.}, volume = {25}, number = {5}, pages = {766--767}, year = {2016}, url = {https://doi.org/10.1017/S0963548316000055}, doi = {10.1017/S0963548316000055}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KeevashL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashM15, author = {Peter Keevash and Richard Mycroft}, title = {A multipartite Hajnal-Szemer{\'{e}}di theorem}, journal = {J. Comb. Theory {B}}, volume = {114}, pages = {187--236}, year = {2015}, url = {https://doi.org/10.1016/j.jctb.2015.04.003}, doi = {10.1016/J.JCTB.2015.04.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/AllenKSV14, author = {Peter Allen and Peter Keevash and Benny Sudakov and Jacques Verstra{\"{e}}te}, title = {Tur{\'{a}}n numbers of bipartite graphs plus an odd cycle}, journal = {J. Comb. Theory {B}}, volume = {106}, pages = {134--162}, year = {2014}, url = {https://doi.org/10.1016/j.jctb.2014.01.007}, doi = {10.1016/J.JCTB.2014.01.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/AllenKSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KeevashLM14, author = {Peter Keevash and John Lenz and Dhruv Mubayi}, title = {Spectral Extremal Problems for Hypergraphs}, journal = {{SIAM} J. Discret. Math.}, volume = {28}, number = {4}, pages = {1838--1854}, year = {2014}, url = {https://doi.org/10.1137/130929370}, doi = {10.1137/130929370}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KeevashLM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KeevashL14, author = {Peter Keevash and Eoin Long}, title = {Frankl-R{\"{o}}dl type theorems for codes and permutations}, journal = {CoRR}, volume = {abs/1402.6294}, year = {2014}, url = {http://arxiv.org/abs/1402.6294}, eprinttype = {arXiv}, eprint = {1402.6294}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KeevashL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KeevashSV13, author = {Peter Keevash and Benny Sudakov and Jacques Verstra{\"{e}}te}, title = {On a conjecture of Erd{\H{o}}s and Simonovits: Even cycles}, journal = {Comb.}, volume = {33}, number = {6}, pages = {699--732}, year = {2013}, url = {https://doi.org/10.1007/s00493-013-2863-8}, doi = {10.1007/S00493-013-2863-8}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KeevashSV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/ChristofidesEK13, author = {Demetres Christofides and David Ellis and Peter Keevash}, title = {An Approximate Vertex-Isoperimetric Inequality for r-sets}, journal = {Electron. J. Comb.}, volume = {20}, number = {4}, pages = {15}, year = {2013}, url = {https://doi.org/10.37236/2458}, doi = {10.37236/2458}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/ChristofidesEK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HefetzK13, author = {Dan Hefetz and Peter Keevash}, title = {A hypergraph Tur{\'{a}}n theorem via lagrangians of intersecting families}, journal = {J. Comb. Theory {A}}, volume = {120}, number = {8}, pages = {2020--2038}, year = {2013}, url = {https://doi.org/10.1016/j.jcta.2013.07.011}, doi = {10.1016/J.JCTA.2013.07.011}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HefetzK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KeevashLMR13, author = {Peter Keevash and Zhentao Li and Bojan Mohar and Bruce A. Reed}, title = {Digraph Girth via Chromatic Number}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {2}, pages = {693--696}, year = {2013}, url = {https://doi.org/10.1137/120875892}, doi = {10.1137/120875892}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KeevashLMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KeevashKM13, author = {Peter Keevash and Fiachra Knox and Richard Mycroft}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {Polynomial-time perfect matchings in dense hypergraphs}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {311--320}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488647}, doi = {10.1145/2488608.2488647}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KeevashKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashM12, author = {Peter Keevash and Dhruv Mubayi}, title = {The Tur{\'{a}}n Number of \emph{F}\({}_{\mbox{3, 3}}\)}, journal = {Comb. Probab. Comput.}, volume = {21}, number = {3}, pages = {451--456}, year = {2012}, url = {https://doi.org/10.1017/S0963548311000678}, doi = {10.1017/S0963548311000678}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KeevashM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/ChristofidesKKO12, author = {Demetres Christofides and Peter Keevash and Daniela K{\"{u}}hn and Deryk Osthus}, title = {Finding Hamilton cycles in robustly expanding digraphs}, journal = {J. Graph Algorithms Appl.}, volume = {16}, number = {2}, pages = {335--358}, year = {2012}, url = {https://doi.org/10.7155/jgaa.00261}, doi = {10.7155/JGAA.00261}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgaa/ChristofidesKKO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/JacksonK11, author = {Bill Jackson and Peter Keevash}, title = {Bounded Direction-Length Frameworks}, journal = {Discret. Comput. Geom.}, volume = {46}, number = {1}, pages = {48--71}, year = {2011}, url = {https://doi.org/10.1007/s00454-011-9325-0}, doi = {10.1007/S00454-011-9325-0}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/JacksonK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/JacksonK11a, author = {Bill Jackson and Peter Keevash}, title = {Necessary Conditions for the Global Rigidity of Direction-Length Frameworks}, journal = {Discret. Comput. Geom.}, volume = {46}, number = {1}, pages = {72--85}, year = {2011}, url = {https://doi.org/10.1007/s00454-011-9326-z}, doi = {10.1007/S00454-011-9326-Z}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/JacksonK11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KeevashKMO11, author = {Peter Keevash and Daniela K{\"{u}}hn and Richard Mycroft and Deryk Osthus}, title = {Loose Hamilton cycles in hypergraphs}, journal = {Discret. Math.}, volume = {311}, number = {7}, pages = {544--559}, year = {2011}, url = {https://doi.org/10.1016/j.disc.2010.11.013}, doi = {10.1016/J.DISC.2010.11.013}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KeevashKMO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Keevash11, author = {Peter Keevash}, title = {A hypergraph blow-up lemma}, journal = {Random Struct. Algorithms}, volume = {39}, number = {3}, pages = {275--376}, year = {2011}, url = {https://doi.org/10.1002/rsa.20362}, doi = {10.1002/RSA.20362}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Keevash11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KeevashM10, author = {Peter Keevash and Dhruv Mubayi}, title = {Set systems without a simplex or a cluster}, journal = {Comb.}, volume = {30}, number = {2}, pages = {175--200}, year = {2010}, url = {https://doi.org/10.1007/s00493-010-2401-x}, doi = {10.1007/S00493-010-2401-X}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KeevashM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FoxKS10, author = {Jacob Fox and Peter Keevash and Benny Sudakov}, title = {Directed Graphs Without Short Cycles}, journal = {Comb. Probab. Comput.}, volume = {19}, number = {2}, pages = {285--301}, year = {2010}, url = {https://doi.org/10.1017/S0963548309990460}, doi = {10.1017/S0963548309990460}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FoxKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashS10, author = {Peter Keevash and Benny Sudakov}, title = {Pancyclicity of Hamiltonian and highly connected graphs}, journal = {J. Comb. Theory {B}}, volume = {100}, number = {5}, pages = {456--467}, year = {2010}, url = {https://doi.org/10.1016/j.jctb.2010.02.001}, doi = {10.1016/J.JCTB.2010.02.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/ChristofidesKKO10, author = {Demetres Christofides and Peter Keevash and Daniela K{\"{u}}hn and Deryk Osthus}, title = {A Semiexact Degree Condition for Hamilton Cycles in Digraphs}, journal = {{SIAM} J. Discret. Math.}, volume = {24}, number = {3}, pages = {709--756}, year = {2010}, url = {https://doi.org/10.1137/090761756}, doi = {10.1137/090761756}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/ChristofidesKKO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashS09, author = {Peter Keevash and Benny Sudakov}, title = {Triangle packings and 1-factors in oriented graphs}, journal = {J. Comb. Theory {B}}, volume = {99}, number = {4}, pages = {709--727}, year = {2009}, url = {https://doi.org/10.1016/j.jctb.2008.12.004}, doi = {10.1016/J.JCTB.2008.12.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Keevash09, author = {Peter Keevash}, title = {A hypergraph regularity method for generalized Tur{\'{a}}n problems}, journal = {Random Struct. Algorithms}, volume = {34}, number = {1}, pages = {123--164}, year = {2009}, url = {https://doi.org/10.1002/rsa.20249}, doi = {10.1002/RSA.20249}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Keevash09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashMSV07, author = {Peter Keevash and Dhruv Mubayi and Benny Sudakov and Jacques Verstra{\"{e}}te}, title = {Rainbow Tur{\'{a}}n Problems}, journal = {Comb. Probab. Comput.}, volume = {16}, number = {1}, pages = {109--126}, year = {2007}, url = {https://doi.org/10.1017/S0963548306007760}, doi = {10.1017/S0963548306007760}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/KeevashMSV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashZ07, author = {Peter Keevash and Yi Zhao}, title = {Codegree problems for projective geometries}, journal = {J. Comb. Theory {B}}, volume = {97}, number = {6}, pages = {919--928}, year = {2007}, url = {https://doi.org/10.1016/j.jctb.2007.01.004}, doi = {10.1016/J.JCTB.2007.01.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/KeevashLS06, author = {Peter Keevash and Po{-}Shen Loh and Benny Sudakov}, title = {Bounding the Number of Edges in Permutation Graphs}, journal = {Electron. J. Comb.}, volume = {13}, number = {1}, year = {2006}, url = {https://doi.org/10.37236/1070}, doi = {10.37236/1070}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/KeevashLS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/KeevashK06, author = {Peter Keevash and Cheng Yeaw Ku}, title = {A random construction for permutation codes and the covering radius}, journal = {Des. Codes Cryptogr.}, volume = {41}, number = {1}, pages = {79--86}, year = {2006}, url = {https://doi.org/10.1007/s10623-006-0017-3}, doi = {10.1007/S10623-006-0017-3}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/KeevashK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/AnsteeK06, author = {Richard P. Anstee and Peter Keevash}, title = {Pairwise intersections and forbidden configurations}, journal = {Eur. J. Comb.}, volume = {27}, number = {8}, pages = {1235--1248}, year = {2006}, url = {https://doi.org/10.1016/j.ejc.2006.05.002}, doi = {10.1016/J.EJC.2006.05.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/AnsteeK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashS06a, author = {Peter Keevash and Benny Sudakov}, title = {Sparse halves in triangle-free graphs}, journal = {J. Comb. Theory {B}}, volume = {96}, number = {4}, pages = {614--620}, year = {2006}, url = {https://doi.org/10.1016/j.jctb.2005.11.003}, doi = {10.1016/J.JCTB.2005.11.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashS06a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BaloghKS06, author = {J{\'{o}}zsef Balogh and Peter Keevash and Benny Sudakov}, title = {On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs}, journal = {J. Comb. Theory {B}}, volume = {96}, number = {6}, pages = {919--932}, year = {2006}, url = {https://doi.org/10.1016/j.jctb.2006.03.001}, doi = {10.1016/J.JCTB.2006.03.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BaloghKS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashS06, author = {Peter Keevash and Benny Sudakov}, title = {On a restricted cross-intersection problem}, journal = {J. Comb. Theory {A}}, volume = {113}, number = {7}, pages = {1536--1542}, year = {2006}, url = {https://doi.org/10.1016/j.jcta.2005.10.008}, doi = {10.1016/J.JCTA.2005.10.008}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KeevashMW06, author = {Peter Keevash and Dhruv Mubayi and Richard M. Wilson}, title = {Set Systems with No Singleton Intersection}, journal = {{SIAM} J. Discret. Math.}, volume = {20}, number = {4}, pages = {1031--1041}, year = {2006}, url = {https://doi.org/10.1137/050647372}, doi = {10.1137/050647372}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KeevashMW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KeevashS05, author = {Peter Keevash and Benny Sudakov}, title = {The Tur{\'{a}}n Number Of The Fano Plane}, journal = {Comb.}, volume = {25}, number = {5}, pages = {561--574}, year = {2005}, url = {https://doi.org/10.1007/s00493-005-0034-2}, doi = {10.1007/S00493-005-0034-2}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KeevashS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KeevashS05a, author = {Peter Keevash and Benny Sudakov}, title = {On {A} Hypergraph Tur{\'{a}}n Problem Of Frankl}, journal = {Comb.}, volume = {25}, number = {6}, pages = {673--706}, year = {2005}, url = {https://doi.org/10.1007/s00493-005-0042-2}, doi = {10.1007/S00493-005-0042-2}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KeevashS05a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/Keevash05, author = {Peter Keevash}, title = {The Tur{\'{a}}n Problem for Hypergraphs of Fixed Size}, journal = {Electron. J. Comb.}, volume = {12}, year = {2005}, url = {https://doi.org/10.37236/1978}, doi = {10.37236/1978}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/Keevash05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BaloghKS05, author = {J{\'{o}}zsef Balogh and Peter Keevash and Benny Sudakov}, title = {Disjoint representability of sets and their complements}, journal = {J. Comb. Theory {B}}, volume = {95}, number = {1}, pages = {12--28}, year = {2005}, url = {https://doi.org/10.1016/j.jctb.2005.02.005}, doi = {10.1016/J.JCTB.2005.02.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BaloghKS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Keevash05, author = {Peter Keevash}, title = {The Tur{\'{a}}n problem for projective geometries}, journal = {J. Comb. Theory {A}}, volume = {111}, number = {2}, pages = {289--309}, year = {2005}, url = {https://doi.org/10.1016/j.jcta.2004.12.007}, doi = {10.1016/J.JCTA.2004.12.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Keevash05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KeevashS05, author = {Peter Keevash and Benny Sudakov}, title = {Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices}, journal = {{SIAM} J. Discret. Math.}, volume = {18}, number = {4}, pages = {713--727}, year = {2005}, url = {https://doi.org/10.1137/S0895480103434634}, doi = {10.1137/S0895480103434634}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KeevashS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aam/KeevashSSV04, author = {Peter Keevash and Michael E. Saks and Benny Sudakov and Jacques Verstra{\"{e}}te}, title = {Multicolour Tur{\'{a}}n problems}, journal = {Adv. Appl. Math.}, volume = {33}, number = {2}, pages = {238--262}, year = {2004}, url = {https://doi.org/10.1016/j.aam.2003.08.005}, doi = {10.1016/J.AAM.2003.08.005}, timestamp = {Thu, 12 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aam/KeevashSSV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashS04, author = {Peter Keevash and Benny Sudakov}, title = {On the number of edges not covered by monochromatic copies of a fixed graph}, journal = {J. Comb. Theory {B}}, volume = {90}, number = {1}, pages = {41--53}, year = {2004}, url = {https://doi.org/10.1016/S0095-8956(03)00075-3}, doi = {10.1016/S0095-8956(03)00075-3}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KeevashM04, author = {Peter Keevash and Dhruv Mubayi}, title = {Stability theorems for cancellative hypergraphs}, journal = {J. Comb. Theory {B}}, volume = {92}, number = {1}, pages = {163--175}, year = {2004}, url = {https://doi.org/10.1016/j.jctb.2004.05.003}, doi = {10.1016/J.JCTB.2004.05.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KeevashM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BollobasKS04, author = {B{\'{e}}la Bollob{\'{a}}s and Peter Keevash and Benny Sudakov}, title = {Multicoloured extremal problems}, journal = {J. Comb. Theory {A}}, volume = {107}, number = {2}, pages = {295--312}, year = {2004}, url = {https://doi.org/10.1016/j.jcta.2004.05.003}, doi = {10.1016/J.JCTA.2004.05.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BollobasKS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KeevashS04, author = {Peter Keevash and Benny Sudakov}, title = {Packing triangles in a graph and its complement}, journal = {J. Graph Theory}, volume = {47}, number = {3}, pages = {203--216}, year = {2004}, url = {https://doi.org/10.1002/jgt.20031}, doi = {10.1002/JGT.20031}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KeevashS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KeevashS03, author = {Peter Keevash and Benny Sudakov}, title = {Local Density In Graphs With Forbidden Subgraphs}, journal = {Comb. Probab. Comput.}, volume = {12}, number = {2}, pages = {139--153}, year = {2003}, url = {https://doi.org/10.1017/S0963548302005539}, doi = {10.1017/S0963548302005539}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KeevashS03.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.