Families of triples with high minimum degree are Hamiltonian (Q2450131): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vojtěch Rödl / rank
 
Normal rank
Property / author
 
Property / author: Andrzej Ruciński / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1743 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044905288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(r\)-partite \(r\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal hypergraphs for Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type results for loose Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in hypergraphs of large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / 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: Perfect matchings in uniform hypergraphs with large minimum degree / 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: Perfect matchings in large uniform hypergraphs with large minimum collective degree / 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 / cites work
 
Property / cites work: Q3568712 / rank
 
Normal rank

Latest revision as of 12:21, 8 July 2024

scientific article
Language Label Description Also known as
English
Families of triples with high minimum degree are Hamiltonian
scientific article

    Statements

    Families of triples with high minimum degree are Hamiltonian (English)
    0 references
    16 May 2014
    0 references
    3-uniform hypergraph
    0 references
    Hamilton cycle
    0 references
    minimum vertex degree
    0 references
    0 references
    0 references

    Identifiers

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