The number of edges in induced subgraphs of some distance graphs
From MaRDI portal
Publication:2314127
DOI10.1134/S0001434619030313zbMath1434.05073OpenAlexW2943890861WikidataQ127902293 ScholiaQ127902293MaRDI QIDQ2314127
Publication date: 19 July 2019
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434619030313
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12)
Related Items (12)
On the minimal number of edges in induced subgraphs of special distance graphs ⋮ On a Frankl-Wilson theorem ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On stability of the independence number of a certain distance graph ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Modularity of some distance graphs ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ New Turán type bounds for Johnson graphs
Cites Work
- Independence numbers of random subgraphs of a distance graph
- On the number of edges in induced subgraphs of a special distance graph
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- On chromatic numbers of nearly Kneser distance graphs
- On the chromatic number of a random subgraph of the Kneser graph
- Codes with forbidden distances
- Exponentially Ramsey sets
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic numbers of low-dimensional spaces
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Turán-type bounds for distance graphs
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- The Mathematical Coloring Book
- On the chromatic number of an infinitesimal plane layer
- On the Frankl–Rödl theorem
- Combinatorial Geometry and Coding Theory*
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The number of edges in induced subgraphs of some distance graphs
