Integer sequences without singleton intersection

DOI10.2140/moscow.2023.12.127zbMath1515.05176OpenAlexW4379346490MaRDI QIDQ6098042

Peter Frankl, Jian Wang

Publication date: 9 June 2023

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2023.12.127

zbMATH Keywords

integer sequences\(L\)-intersectingsingleton intersection

Mathematics Subject Classification ID

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

Cites Work

• The complete intersection theorem for systems of finite sets
• An ordered version of the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem
• Forbidding just one intersection
• Extremal problems and coverings of the space
• Nombre chromatique total d'un hypergraphe
• Disjoint edges in separated hypergraphs
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On families of finite sets no two of which intersect in a singleton
• Intersection Properties of Systems of Finite Sets
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Set Systems with No Singleton Intersection
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer sequences without singleton intersection