Turán-type results for distance graphs in an infinitesimal plane layer
From MaRDI portal
Publication:2632552
DOI10.1007/s10958-018-4133-1zbMath1414.05104OpenAlexW2904459941MaRDI QIDQ2632552
Publication date: 14 May 2019
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-4133-1
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
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 ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ Systems of representatives ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Turán type results for distance graphs
- Independent sets in graphs
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- On computational complexity of length embeddability of graphs
- Coloring Distance Graphs and Graphs of Diameters
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- On the chromatic number of an infinitesimal plane layer
- Combinatorial Geometry and Coding Theory*
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- On Sets of Distances of n Points
This page was built for publication: Turán-type results for distance graphs in an infinitesimal plane layer
