More on block intersection polynomials and new applications to graphs and block designs

DOI10.1016/j.jcta.2010.03.005zbMath1228.05080OpenAlexW2061246145MaRDI QIDQ986117

Leonard H. Soicher

Publication date: 11 August 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.03.005

zbMATH Keywords

strongly regular graph\(t\)-designcliqueblock designintersection numberamply regular graphedge-regular graphblock intersection polynomial

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

The smallest strictly Neumaier graph and its generalisations ⋮ On cliques in edge-regular graphs ⋮ On cliques in isoregular graphs ⋮ On the clique number of a strongly regular graph ⋮ On generalised \(t\)-designs and their parameters ⋮ Upper bounds on the size of transitive subtournaments in digraphs ⋮ Designs, Groups and Computing ⋮ Bounds for regular induced subgraphs of strongly regular graphs

Uses Software

• GAP
• DISCRETA
• DESIGN

Cites Work

• Simple \(8\)-designs with small parameters
• High order intersection numbers of \(t\)-designs
• Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
• On balanced incomplete-block designs with repeated blocks
• Block intersection polynomials
• Computer reconstruction of small graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More on block intersection polynomials and new applications to graphs and block designs