Set systems containing no singleton intersection and the Delsarte number

DOI10.47443/DML.2025.230MaRDI QIDQ7249902zbMATH OpenFDO

Authors William Linz

Publication date 19 May 2026

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/DML.2025.230

zbMATH Keywords

\(L\)-systemsDelsarte numberLovász numbersingleton intersection

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial optimization (90C27)

Cites work

• L-systems and the Lovász number
• A comparison of the Delsarte and Lovász bounds
• Erdős-Ko-Rado theorems. Algebraic approaches
• Forbidding just one intersection
• scientific article; zbMATH DE number 3523543 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On families of finite sets no two of which intersect in a singleton
• On set systems without singleton intersections
• On the Shannon capacity of a graph
• Set Systems with No Singleton Intersection
• Spread approximations for forbidden intersections problems
• Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters

This page was built for publication: Set systems containing no singleton intersection and the Delsarte number

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