Resilient hypergraphs with fixed matching number

DOI10.1007/S00493-016-3579-3MaRDI QIDQ1715070zbMATH OpenOpenAlexFDO

Authors Peter Frankl

Publication date 1 February 2019

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-016-3579-3

zbMATH Keywords

matching numberHilton-Milner theoremresilient hypergraphErdős matching conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• On matchings in hypergraphs
• Stability on matchings in 3-uniform hypergraphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• On the maximum number of edges in hypergraphs with fixed matching and clique number

Cited in

(2)

• Tight bounds for Katona's shadow intersection theorem
• Co-degrees resilience for perfect matchings in random hypergraphs

This page was built for publication: Resilient hypergraphs with fixed matching number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715070)