Monochromatic cycle partitions of graphs with large minimum degree (Q345114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963975174 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.1874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 2-edge-colored graphs by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Cycles in 2-Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the circumference of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the monochromatic cycle partition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of the path-path Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 3-colored complete graphs into three monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree sequences in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to avoid using the regularity Lemma: Pósa's conjecture revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Turán type problems and related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 00:39, 13 July 2024

scientific article
Language Label Description Also known as
English
Monochromatic cycle partitions of graphs with large minimum degree
scientific article

    Statements

    Monochromatic cycle partitions of graphs with large minimum degree (English)
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    regularity lemma
    0 references
    absorbing
    0 references
    robust expansion
    0 references
    monochromatic partitioning
    0 references
    Ramsey-type problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references