New Turán type bounds for Johnson graphs
From MaRDI portal
Publication:2068827
Recommendations
- New bounds for the clique-chromatic numbers of Johnson graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- New lower bound on the modularity of Johnson graphs
- scientific article; zbMATH DE number 6602525
- On the spectra of Johnson graphs
- A classification of the strongly regular generalised Johnson graphs
- Some algebraic aspects of enhanced Johnson graphs
- Turán-type bounds for distance graphs
- Some new results on Jacobson graphs
- The Terwilliger algebras of Johnson graphs
Cites work
- A generalization of Kneser graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- All finite sets are Ramsey in the maximum norm
- Bounds on Borsuk numbers in distance graphs of a special type
- Codes with forbidden distances
- Estimate of the number of edges in subgraphs of a Johnson 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 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- Modularity of some distance graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
- The Mathematical Coloring Book
- The number of edges in induced subgraphs of some distance graphs
- Turán type results for distance graphs
Cited in
(2)
This page was built for publication: New Turán type bounds for Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2068827)
