Lower bound on the minimum number of edges in subgraphs of Johnson graphs

DOI10.1134/s0032946022040081zbMath1518.05088OpenAlexW4315564995MaRDI QIDQ6173476

Ya. K. Shubin

Publication date: 21 July 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946022040081

zbMATH Keywords

Johnson graphsdistance graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidding just one intersection
• Intersection theorems with geometric consequences
• New sets with large Borsuk numbers
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Bounds on Borsuk numbers in distance graphs of a special type
• On the minimal number of edges in induced subgraphs of special distance graphs
• Estimate of the number of edges in special subgraphs of a distance graph
• On stability of the independence number of a certain distance graph
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Excursions into combinatorial geometry
• A counterexample to Borsuk’s conjecture
• On the Shannon capacity of a graph
• On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
• Sharp threshold for the Erdős–Ko–Rado theorem

This page was built for publication: Lower bound on the minimum number of edges in subgraphs of Johnson graphs