Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / 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: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / 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: Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture / 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: COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time perfect matchings in dense hypergraphs / 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: Matchings in hypergraphs of large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional and integer matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(F\)-factors in hypergraphs via absorption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees / 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: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs / 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: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank

Revision as of 08:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
scientific article

    Statements

    Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (English)
    0 references
    0 references
    4 August 2016
    0 references
    perfect matching
    0 references
    hypergraph
    0 references
    absorbing method
    0 references
    0 references

    Identifiers