Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q311573
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Klas Markström / 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.1016/j.ejc.2011.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074971154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ryser's conjecture for tripartite 3-graphs / 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: Q4047583 / 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: 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: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdös-Ko-Rado theorem for direct products / 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: COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains 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: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on Ryser's conjecture for intersecting 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: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568712 / 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: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree / rank
 
Normal rank

Revision as of 13:15, 4 July 2024

scientific article
Language Label Description Also known as
English
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
scientific article

    Statements

    Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (English)
    0 references
    0 references
    0 references
    24 October 2011
    0 references
    Hamilton cycles
    0 references
    \(k\)-uniform hypergraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers