Forcing large tight components in 3-graphs (Q1715624): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2018.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Angelos Georgakopoulos / rank
Normal rank
 
Property / author
 
Property / author: Angelos Georgakopoulos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781566485 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.01074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cycles and regular slices in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling the gap between Turán's theorem and Pósa's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonexistence of Certain Finite Projective Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of the giant high‐order component in random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest Components in Random Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inside the critical window for cohomology of random <i>k</i> -complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Non-Existence of Finite Projective Planes of Order 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random 2-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random <i>k</i> -dimensional complexes / 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: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128888723 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2018.11.001 / rank
 
Normal rank

Latest revision as of 05:44, 11 December 2024

scientific article
Language Label Description Also known as
English
Forcing large tight components in 3-graphs
scientific article

    Statements

    Forcing large tight components in 3-graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2019
    0 references
    spanning tight component
    0 references

    Identifiers