Estimate of the number of edges in special subgraphs of a distance graph
From MaRDI portal
Publication:2191968
DOI10.1134/S0001434620010320zbMath1442.05096OpenAlexW3009432397MaRDI QIDQ2191968
F. A. Pushnyakov, Andrei M. Raigorodskii
Publication date: 26 June 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434620010320
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12)
Related Items (9)
On Ramsey numbers for arbitrary sequences of graphs ⋮ On the minimal number of edges in induced subgraphs of special distance graphs ⋮ Lower bound on the minimum number of edges in subgraphs of Johnson graphs ⋮ On stability of the independence number of a certain distance graph ⋮ On dividing sets into parts of smaller diameter ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Bounds on Borsuk numbers in distance graphs of a special type
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Turán type results for distance graphs
- On chromatic numbers of nearly Kneser distance graphs
- On the distance and multidistance graph embeddability problem
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic number of a random subgraph of the Kneser graph
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On a bound in extremal combinatorics
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- On the stability of the independence number of a random subgraph
- On the chromatic numbers of some distance graphs
- Distance graphs with large chromatic numbers and small clique numbers
- Codes with forbidden distances
- Number of nonzero cubic sums
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Exponentially Ramsey sets
- Clique chromatic numbers of intersection graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- The number of edges in induced subgraphs of some distance graphs
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Counterexamples to Borsuk's conjecture with large girth
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- 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
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- Turán-type results for distance graphs in an infinitesimal plane layer
- 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
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- The Mathematical Coloring Book
- On the Frankl–Rödl theorem
- Combinatorial Geometry and Coding Theory*
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- On the chromatic numbers of small-dimensional Euclidean spaces
- Embedding graphs in Euclidean space
This page was built for publication: Estimate of the number of edges in special subgraphs of a distance graph
