On the size of shadow-added intersecting families
From MaRDI portal
Publication:2225446
Recommendations
Cites work
- Coding for Sunflowers
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Improved bounds for Erdős' matching conjecture
- Improved bounds for the sunflower lemma
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- Intersection Theorems for Systems of Sets
- On matchings in hypergraphs
- On maximal paths and circuits of graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- The exact bound in the Erdős-Ko-Rado theorem
- The size of a hypergraph and its matching number
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
Cited in
(9)- On strengthenings of the intersecting shadow theorem
- On the sum of sizes of overlapping families
- Erdős--Ko--Rado for three sets
- scientific article; zbMATH DE number 2103158 (Why is no real title available?)
- Intersecting faces of a simplicial complex via algebraic shifting
- A local version of Katona's intersecting shadow theorem
- Families with restricted matching number and multiply covered shadows
- Some novelties on intersecting families of subsets
- Intersecting families without unique shadow
This page was built for publication: On the size of shadow-added intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225446)