Richard Lang

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Blowing up Dirac's theorem 2024 Richard Lang
Nicolás Sanhueza‐Matamala
+ PDF Chat A hypergraph bandwidth theorem 2024 Richard Lang
Nicolás Sanhueza‐Matamala
+ PDF Chat Simultaneous edge-colourings 2024 Simona Boyadzhiyska
Richard Lang
Allan Lo
Michael Molloy
+ Partitioning a 2-edge-coloured graph of minimum degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e314" altimg="si8.svg"><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>/</mml:mo><mml:mn>3</mml:mn><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> into three monochromatic cycles 2024 Peter Allen
Julia Böttcher
Richard Lang
Jozef Skokan
Maya Stein
+ Sufficient conditions for perfect mixed tilings 2024 Eoin Hurley
Felix Joos
Richard Lang
+ PDF Chat Colour-bias perfect matchings in hypergraphs 2024 Hiệp Hàn
Richard Lang
João Pedro Marciano
Matías Pavez‐Signé
Nicolás Sanhueza‐Matamala
Andrew Treglown
Camila Zárate-Guerén
+ PDF Chat Edge-colouring graphs with local list sizes 2023 Marthe Bonamy
Michelle Delcourt
Richard Lang
Luke Postle
+ PDF Chat On sufficient conditions for spanning structures in dense graphs 2023 Richard Lang
Nicolás Sanhueza‐Matamala
+ PDF Chat An Improved Bound for the Linear Arboricity Conjecture 2023 Richard Lang
Luke Postle
+ Tiling Dense Hypergraphs 2023 Richard Lang
+ Tiling dense hypergraphs 2023 Richard Lang
+ Resilience for loose Hamilton cycles 2023 José D. Alvarado
Yoshiharu Kohayakawa
Richard Lang
Guilherme Oliveira Mota
Henrique Stagni
+ Resilience for Loose Hamilton Cycles 2023 José D. Alvarado
Yoshiharu Kohayakawa
Richard Lang
Guilherme Oliveira Mota
Henrique Stagni
+ Robust Hamiltonicity 2023 Felix Joos
Richard Lang
Nicolás Sanhueza‐Matamala
+ PDF Chat Minimum degree conditions for tight Hamilton cycles 2022 Richard Lang
Nicolás Sanhueza‐Matamala
+ Sufficient conditions for perfect mixed tilings 2022 Eoin Hurley
Felix Joos
Richard Lang
+ Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles 2022 Peter J. Allen
Julia Böttcher
Richard Lang
Jozef Skokan
Maya Stein
+ PDF Chat On the Query Complexity of Estimating the Distance to Hereditary Graph Properties 2021 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ Degree Conditions for Tight Hamilton Cycles 2021 Richard Lang
Nicolás Sanhueza‐Matamala
+ PDF Chat On Sufficient Conditions for Hamiltonicity in Dense Graphs 2021 Richard Lang
Nicolás Sanhueza‐Matamala
+ On sufficient conditions for spanning structures in dense graphs 2021 Richard Lang
Nicolás Sanhueza‐Matamala
+ Minimum degree conditions for monochromatic cycle partitioning 2020 Dániel Korándi
Richard Lang
Shoham Letzter
Alexey Pokrovskiy
+ PDF Chat Monochromatic cycle partitions in random graphs 2020 Richard Lang
Allan Lo
+ PDF Chat Estimating parameters associated with monotone properties 2020 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ An Improved Bound for the Linear Arboricity Conjecture 2020 Richard Lang
Luke Postle
+ Edge-colouring graphs with local list sizes 2020 Marthe Bonamy
Michelle Delcourt
Richard Lang
Luke Postle
+ Minimum degree conditions for tight Hamilton cycles 2020 Richard Lang
Nicolás Sanhueza‐Matamala
+ On the query complexity of estimating the distance to hereditary graph properties. 2019 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ PDF Chat Upper density of monochromatic infinite paths 2019 Jan Corsten
Louis DeBiasio
Ander Lamaison
Richard Lang
+ Asymptotically good local list edge colourings 2019 Marthe Bonamy
Michelle Delcourt
Richard Lang
Luke Postle
+ Minimum degree conditions for monochromatic cycle partitioning 2019 Dániel Korándi
Richard Lang
Shoham Letzter
Alexey Pokrovskiy
+ On the query complexity of estimating the distance to hereditary graph properties 2019 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ Minimum degree conditions for monochromatic cycle partitioning 2019 Dániel Korándi
Richard Lang
Shoham Letzter
Alexey Pokrovskiy
+ Chromatic Index, Treewidth and Maximum Degree 2018 Henning Bruhn
Laura Gellert
Richard Lang
+ Estimating the distance to a hereditary graph property 2017 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles 2017 Richard Lang
Oliver Schaudt
Maya Stein
+ Local colourings and monochromatic partitions in complete bipartite graphs 2016 Richard Lang
Maya Stein
+ PDF Chat Chromatic index, treewidth and maximum degree 2016 Henning Bruhn
Laura Gellert
Richard Lang
+ Chromatic index, treewidth and maximum degree 2016 Henning Bruhn
Laura Gellert
Richard Lang
+ Estimating Parameters Associated with Monotone Properties. 2016 Carlos Hoppen
Yoshiharu Kohayakawa
Richard Lang
Hanno Lefmann
Henrique Stagni
+ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles 2015 Richard Lang
Oliver Schaudt
Maya Stein
+ PDF Chat Local colourings and monochromatic partitions in complete bipartite graphs 2015 Richard Lang
Maya Stein
+ PDF Chat A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3 2015 Richard Lang
+ List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth 2015 Henning Bruhn
Richard Lang
Maya Stein
+ Local colourings and monochromatic partitions in complete bipartite graphs 2015 Richard Lang
Maya Stein
+ Almost partitioning a 3-edge-coloured $K_{n,n}$ into 5 monochromatic cycles 2015 Richard Lang
Oliver Schaudt
Maya Stein
+ A note on total and list edge-colouring of graphs of tree-width 3 2015 Richard Lang
+ On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7 2015 Richard Lang
+ List edge-colouring and total colouring in graphs of low treewidth 2013 Henning Bruhn
Richard Lang
Maya Stein
+ Ein inverses Randwertproblem f�r elektrische Netzwerke 1997 Richard Lang
+ Numberings on Graphs Having Small Edge Weights 1990 Richard Lang
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ REGULAR PARTITIONS OF GRAPHS 1975 Endre Szemerédi
11
+ Vertex coverings by monochromatic cycles and trees 1991 Péter L. Erdős
András Gyárfás
L. Pyber
11
+ Partitioning Complete Bipartite Graphs by Monochromatic Cycles 1997 Penny Haxell
11
+ An improved bound for the monochromatic cycle partition number 2006 András Gyárfás
Miklós Ruszinkó
Gábor N. Sárközy
Endre Szemerédi
10
+ Blow-up Lemma 1997 János Komlós
Gábor N. Sárközy
Endre Szemerédi
10
+ Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture 2009 Stéphane Bessy
Stéphan Thomassé
10
+ PDF Chat Partitioning 2-edge-colored graphs by monochromatic paths and cycles 2014 József Balogh
János Barát
Dániel Gerbner
András Gyárfás
Gábor N. Sárközy
9
+ Partitioning edge-coloured complete graphs into monochromatic cycles and paths 2014 Alexey Pokrovskiy
9
+ Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles 1998 Tomasz Łuczak
Vojtěch Rödl
Endre Szemerédi
8
+ Vertex coverings by monochromatic paths and cycles 1983 András Gyárfás
8
+ Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles 2008 Peter Allen
7
+ List Edge and List Total Colourings of Multigraphs 1997 O. V. Borodin
Alexandr Kostochka
Douglas R. Woodall
7
+ PDF Chat Monochromatic cycle partitions of edge-colored graphs 2010 Gábor N. Sárközy
6
+ Hamilton cycles in graphs and hypergraphs: an extremal perspective 2014 Daniela Kühn
Deryk Osthus
5
+ Recent Advances on the Hamiltonian Problem: Survey III 2013 Ronald J. Gould
5
+ PDF Chat Restricted colorings of graphs 1993 Noga Alon
5
+ R(Cn,Cn,Cn)⩽(4+o(1))n 1999 Tomasz Łuczak
5
+ Proof of the bandwidth conjecture of Bollobás and Komlós 2008 Julia Böttcher
Mathias Schacht
Anusch Taraz
5
+ PDF Chat Holes in Graphs 2001 Yuejian Peng
Vojtěch Rödl
Andrzej Ruciński
5
+ PDF Chat Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles 2011 András Gyárfás
Miklós Ruszinkó
Gábor N. Sárközy
Endre Szemerédi
5
+ Partitioning 3-coloured complete graphs into three monochromatic paths 2011 Alexey Pokrovskiy
5
+ Monochromatic cycle partitions of graphs with large minimum degree 2016 Louis DeBiasio
Luke L. Nelsen
5
+ PDF Chat Monochromatic Cycle Partitions in Local Edge Colorings 2015 David Conlon
Maya Stein
5
+ PDF Chat Bounds for graph regularity and removal lemmas 2012 David Conlon
Jacob Fox
4
+ Blow-up lemmas for sparse graphs 2016 Peter Allen
Julia Böttcher
Hiệp Hàn
Yoshiharu Kohayakawa
Yury Person
4
+ Total Colorings Of Degenerate Graphs 2007 Shuji Isobe
Xiao Zhou
Takao Nishizeki
4
+ PDF Chat A geometric theory for hypergraph matching 2014 Peter Keevash
Richard Mycroft
4
+ Vertex Partitions by Connected Monochromatic k-Regular Graphs 2000 Gábor N. Sárközy
Stanley M. Selkow
4
+ PDF Chat Monochromatic cycle covers in random graphs 2018 Dániel Korándi
Frank Mousset
Rajko Nenadov
Nemanja Škorić
Benny Sudakov
4
+ PDF Chat Recent advances on Dirac-type problems for hypergraphs 2016 Yi Zhao
4
+ List edge colourings of some 1-factorable multigraphs 1996 M. N. Ellingham
Luis Goddyn
4
+ SOME UNSOLVED PROBLEMS IN GRAPH THEORY 1968 V. G. Vizing
4
+ List colourings of graphs 2001 Douglas R. Woodall
4
+ PDF Chat A new proof of the graph removal lemma 2011 Jacob Fox
4
+ Asymptotically Good List-Colorings 1996 Jeff Kahn
4
+ Local colourings and monochromatic partitions in complete bipartite graphs 2016 Richard Lang
Maya Stein
4
+ Perfect matchings in large uniform hypergraphs with large minimum collective degree 2008 Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
3
+ List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth 2015 Henning Bruhn
Richard Lang
Maya Stein
3
+ PDF Chat Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing 2008 Christian Borgs
Jennifer Chayes
L. Lovász
Vera T. Sós
K. Vesztergombi
3
+ PDF Chat Embedding Spanning Bipartite Graphs of Small Bandwidth 2012 Fiachra Knox
Andrew Treglown
3
+ On Hamilton's ideals 1972 Vašek Chvátal
3
+ PDF Chat Proof of the 1-factorization and Hamilton Decomposition Conjectures 2016 Béla Csaba
Daniela Kühn
Allan Lo
Deryk Osthus
Andrew Treglown
3
+ PDF Chat Additive approximation for edge-deletion problems 2009 Ilan Alon
A. Shapira
Benny Sudakov
3
+ One-sided Coverings of Colored Complete Bipartite Graphs 2007 András Gyárfás
Miklós Ruszinkó
Gábor N. Sárközy
Endre Szemerédi
3
+ Vertex covers by monochromatic pieces — A survey of results and problems 2015 András Gyárfás
3
+ Spanning 3-colourable subgraphs of small bandwidth in dense graphs 2008 Julia Böttcher
Mathias Schacht
Anusch Taraz
3
+ Every Planar Graph with Maximum Degree 7 Is of Class 1 2000 Limin Zhang
3
+ Hamiltonian degree sequences in digraphs 2009 Daniela Kühn
Deryk Osthus
Andrew Treglown
3
+ PDF Chat Three-color Ramsey numbers for paths 2008 András Gyárfás
Miklós Ruszinkó
Gábor N. Sárközy
Endre Szemerédi
3
+ Large planar subgraphs in dense graphs 2005 Daniela Kühn
Deryk Osthus
Anusch Taraz
3