Approximately strongly regular graphs

DOI10.1016/j.disc.2022.113299OpenAlexW4313498849MaRDI QIDQ2111940

Ferdinand Ihringer

Publication date: 17 January 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.05792

zbMATH Keywords

strongly regular graphscapsabsolute boundKrein conditionsinertia boundclique-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Linear codes and caps in Galois spaces (51E22)

Uses Software

• GENREG
• equiangular17

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• The early evolution of the \(H\)-free process
• On \(k\)-walk-regular graphs
• A note on Ramsey numbers
• Graphs which contain all small graphs
• Spherical codes and designs
• Recursive constructions for large caps
• Explicit Ramsey graphs and orthonormal labelings
• Constructive bounds for a Ramsey-type problem
• Extensions of generalized product caps
• Interlacing eigenvalues and graphs
• A construction for clique-free pseudorandom graphs
• An asymptotic existence result on compressed sensing matrices
• Reaching a Quantum Consensus: Master Equations that Generate Symmetrization and Synchronization
• On quasi-strongly regular graphs
• Fast generation of regular graphs and construction of cages
• Paths in graphs
• Strongly Regular Graphs
• Large caps in small spaces

This page was built for publication: Approximately strongly regular graphs