On a Frankl-Wilson theorem
From MaRDI portal
Publication:2190926
DOI10.1134/S0032946019040045zbMath1457.05039OpenAlexW3002015811MaRDI QIDQ2190926
Publication date: 23 June 2020
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946019040045
Related Items (9)
Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ On stability of the independence number of a certain distance graph ⋮ Ramsey theory in the -space with Chebyshev metric ⋮ 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 ⋮ All finite sets are Ramsey in the maximum norm
Cites Work
- Unnamed Item
- Unnamed Item
- Transitive sets in Euclidean Ramsey theory
- Intersection theorems with geometric consequences
- On a bound in extremal combinatorics
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Regular bipartite graphs and intersecting families
- Distance graphs with large chromatic numbers and small clique numbers
- Distance graphs with large chromatic number and arbitrary girth
- Codes with forbidden distances
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Exponentially Ramsey sets
- On the partition of an odd number into three primes in a prescribed proportion
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On lower bounds for the chromatic number of spheres
- 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\)
- 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
- The Difference Between Consecutive Primes, II
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Frankl-Rödl-type theorems for codes and permutations
- Coloring Distance Graphs and Graphs of Diameters
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- Forbidden Intersections
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- On the Frankl–Rödl theorem
- Combinatorial Geometry and Coding Theory*
- On the chromatic number of a space with forbidden equilateral triangle
- Partition‐free families of sets
- Some Theorems in the Analytic Theory of Numbers
- On the chromatic numbers of small-dimensional Euclidean spaces
- A new proof of Szemerédi's theorem
This page was built for publication: On a Frankl-Wilson theorem
