New Turán type bounds for Johnson graphs

DOI10.1134/S0032946021040074zbMath1481.05075OpenAlexW4205636887MaRDI QIDQ2068827

N. A. Dubinin

Publication date: 20 January 2022

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

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

zbMATH Keywords

Johnson graphsdistance graphsTurán theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12)

Related Items (1)

On Ramsey numbers for arbitrary sequences of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new estimate for the number of edges in induced subgraphs of a special distance graph
• Turán type results for distance graphs
• Forbidding just one intersection
• Codes with forbidden distances
• Bounds on Borsuk numbers in distance graphs of a special type
• A generalization of Kneser graphs
• New bounds on clique-chromatic numbers of Johnson graphs
• Modularity of some distance graphs
• Estimate of the number of edges in subgraphs of a Johnson graph
• The number of edges in induced subgraphs of some distance graphs
• Excursions into combinatorial geometry
• The Mathematical Coloring Book
• All finite sets are Ramsey in the maximum norm
• On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$

This page was built for publication: New Turán type bounds for Johnson graphs