Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs (Q5366961): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1508.05152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling 3-Uniform Hypergraphs With K43−2e / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight co-degree condition for perfect matchings in 4-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs / 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: Q5620621 / 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: Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors / 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 vertex degree thresholds for tiling complete 3-partite 3-graphs / 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: Minimum Vertex Degree Threshold for ‐tiling* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric theory for hypergraph matching / 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: Perfect matchings in 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / 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: Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum degree threshold for perfect graph packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum codegree threshold for \((K^3_4-e)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(F\)-factors in hypergraphs via absorption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(k\)-partite \(k\)-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: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on perfect matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963991599 / rank
 
Normal rank

Latest revision as of 09:43, 30 July 2024

scientific article; zbMATH DE number 6788966
Language Label Description Also known as
English
Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs
scientific article; zbMATH DE number 6788966

    Statements

    Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs (English)
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    0 references
    0 references

    Identifiers