Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tight cycles and regular slices in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian problem and \(t\)-path traceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing large tight components in 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal hypergraphs for Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and tiling hypergraphs with tight cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of perfect matchings and packings in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles / 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: Hypergraphs, quasi-randomness, and conditions for regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in graphs and hypergraphs: an extremal perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion and deficiency problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the vertices of a graph by vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs / 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: An approximate Dirac-type theorem for \(k\)-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 / cites work
 
Property / cites work: Recent trends in combinatorics / rank
 
Normal rank

Revision as of 02:06, 3 August 2024

scientific article; zbMATH DE number 7746551
Language Label Description Also known as
English
Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
scientific article; zbMATH DE number 7746551

    Statements

    Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (English)
    0 references
    5 October 2023
    0 references
    Hamilton cycle
    0 references
    tight path
    0 references
    0 references
    0 references

    Identifiers

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