Polynomial-time perfect matchings in dense hypergraphs (Q475264): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2014.10.009 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047917450 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.2608 / 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: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Meets Hypergraph Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for hypergraphs and quasi-randomness / 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: Degrees giving independent edges in a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: 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: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in 3-partite 3-uniform hypergraphs / 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: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree / 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: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2014.10.009 / rank
 
Normal rank

Latest revision as of 18:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Polynomial-time perfect matchings in dense hypergraphs
scientific article

    Statements

    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2014
    0 references
    hypergraphs
    0 references
    algorithms
    0 references
    matchings
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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