Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123014074 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.07535 / 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: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / 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: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem with conditions on the maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for Erdős' matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in a hypergraph with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Huang-Zhao theorem on intersecting families with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / 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: On Erdős' extremal problem on matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-degree density of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank

Latest revision as of 21:05, 13 July 2024

scientific article
Language Label Description Also known as
English
Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
scientific article

    Statements

    Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (English)
    0 references
    0 references
    0 references
    29 May 2017
    0 references
    degree version
    0 references
    hypergraph matching
    0 references
    algebraic method
    0 references

    Identifiers