Turán type results for distance graphs
DOI10.1007/S00454-016-9817-ZzbMATH Open1347.05053OpenAlexW2509064220MaRDI QIDQ331389FDOQ331389
Authors: Lev E. Shabanov, Andrei M. Raigorodskii 
Publication date: 27 October 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-016-9817-z
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)
Cites Work
- Research Problems in Discrete Geometry
- Coloring distance graphs and graphs of diameters
- Finding Independent Sets in Triangle-Free Graphs
- The realization of distances within sets in Euclidean space
- On Sets of Distances of n Points
- Title not available (Why is that?)
- Independence, clique size and maximum degree
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- On large subgraphs of a distance graph which have small chromatic number
- Lower bounds on size and independence inK4-free graphs
Cited In (18)
- Turán theorems and convexity invariants for directed graphs
- Note on a Turán-type problem on distances.
- On threshold probability for the stability of independent sets in distance graphs
- The maximal length of a gap between \(r\)-graph Turán densities
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- New Turán type bounds for Johnson graphs
- On the stability of the independence number of a random subgraph
- Small unit-distance graphs in the plane
- Interview with Andrei Raigorodskii
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- 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 minimal number of edges in induced subgraphs of special distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
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)
