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

DOI10.1134/S0032946022040081MaRDI QIDQ6173476zbMATH OpenOpenAlexFDO

Authors 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

distance graphsJohnson graphs

Mathematics Subject Classification ID

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

Cites work

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

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

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