Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree

DOI10.1017/S0963548321000201MaRDI QIDQ5886310zbMATH OpenFDO

Authors József Balogh, Mikhail Lavrov, Xujun Liu, Alexandr Kostochka

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.02854

zbMATH Keywords

cyclespathsRamsey numberregularity lemma

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• Monochromatic cycles in 2-coloured graphs
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

Cites work

• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• A Ramsey-type problem in directed and bipartite graphs
• Blow-up lemma
• Cycles in bipartite graphs
• Cycles of even length in graphs
• scientific article; zbMATH DE number 19220 (Why is no real title available?)
• scientific article; zbMATH DE number 3485819 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
• Monochromatic cycles in 2-coloured graphs
• On Hamilton's ideals
• Pancyclic graphs. I
• Some Ramsey-Turán type problems and related questions
• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• The Ramsey number for a triple of long even cycles
• Tripartite Ramsey numbers for paths

Cited in

(14)

• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On Schelp's problem for three odd long cycles
• Long monochromatic paths and cycles in 2-colored bipartite graphs
• Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
• Monochromatic cycles in 2-coloured graphs
• Monochromatic cycles and monochromatic paths in arc-colored digraphs
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• Monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree
• Degree conditions for Ramsey goodness of paths
• A note on degree conditions for Ramsey goodness of paths
• Monochromatic cycles in 2-edge-colored bipartite graphs
• Ramsey numbers of cycles in random graphs
• Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

This page was built for publication: Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886310)