Recommendations
- Turán-type bounds for distance graphs
- A Turán-type problem on distances in graphs
- Turán-type results for distance graphs in an infinitesimal plane layer
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
- On Distance-Transitive Graphs
- An extremal property of Turán graphs
- scientific article; zbMATH DE number 3819765
- On almost distance-transitive graphs
- On mean distance in certain classes of graphs
- Distance graphs and \(T\)-coloring
Cites work
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- Coloring distance graphs and graphs of diameters
- Finding Independent Sets in Triangle-Free Graphs
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- Independence, clique size and maximum degree
- Lower bounds on size and independence inK4-free graphs
- On Sets of Distances of n Points
- On large subgraphs of a distance graph which have small chromatic number
- Research Problems in Discrete Geometry
- The realization of distances within sets in Euclidean space
Cited in
(18)- On threshold probability for the stability of independent sets in distance graphs
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
- Turán-type bounds for distance graphs
- Turán-type results for distance graphs in an infinitesimal plane layer
- A Turán-type problem on distances in graphs
- On the stability of the independence number of a random subgraph
- On the minimal number of edges in induced subgraphs of special distance graphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- New Turán type bounds for Johnson graphs
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- Note on a Turán-type problem on distances.
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
- The maximal length of a gap between \(r\)-graph Turán densities
- Turán theorems and convexity invariants for directed graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- Small unit-distance graphs in the plane
- Interview with Andrei Raigorodskii
This page was built for publication: Turán type results for distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331389)
