Improved monochromatic loose cycle partitions in hypergraphs (Q396737): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2014.06.025 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.06.025 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158456392 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.06.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158456392 / 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: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / 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: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977492 / 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: Partitioning 3-colored complete graphs into three monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-color Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic path and cycle partitions in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number of diamond-matchings and loose cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number for hypergraph cycles. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / 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: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle partitions of edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions by connected monochromatic \(k\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2014.06.025 / rank
 
Normal rank

Latest revision as of 16:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Improved monochromatic loose cycle partitions in hypergraphs
scientific article

    Statements

    Improved monochromatic loose cycle partitions in hypergraphs (English)
    0 references
    14 August 2014
    0 references
    loose hypergraph cycles
    0 references
    monochromatic partitions
    0 references
    0 references
    0 references
    0 references

    Identifiers

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