On a Frankl-Wilson theorem

DOI10.1134/S0032946019040045MaRDI QIDQ2190926zbMATH OpenOpenAlexFDO

Authors A. A. Sagdeev

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

zbMATH Keywords

chromatic numberdistance graphEuclidean Ramsey theoryFrankl-Rödl theoremFrankl-Wilson theoremgirth

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Recommendations

• On the chromatic number of a space
• On the structure of distance graphs with a large chromatic number
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• On the Frankl-Rödl theorem
• Improved Frankl-Rödl theorem and some of its geometric consequences

Cites work

• A new proof of Szemerédi's theorem
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
• Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
• Clique chromatic numbers of intersection graphs
• Codes with forbidden distances
• Coloring distance graphs and graphs of diameters
• Combinatorial geometry and coding theory
• Counterexamples to Borsuk's conjecture with large girth
• Distance graphs with large chromatic number and arbitrary girth
• Exponentially Ramsey sets
• Forbidden Intersections
• Frankl-Rödl-type theorems for codes and permutations
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• Improved Frankl-Rödl theorem and some of its geometric consequences
• Intersection theorems with geometric consequences
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• On a bound in extremal combinatorics
• On lower bounds for the chromatic number of spheres
• On the chromatic number of a space
• On the chromatic number of a space with forbidden equilateral triangle
• On the Frankl-Rödl theorem
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On the partition of an odd number into three primes in a prescribed proportion
• Partition-free families of sets
• Permutation Groups in Euclidean Ramsey Theory
• Regular bipartite graphs and intersecting families
• Research Problems in Discrete Geometry
• Some Theorems in the Analytic Theory of Numbers
• The chromatic number of the plane is at least 5
• The difference between consecutive primes. II
• The Mathematical Coloring Book
• The number of edges in induced subgraphs of some distance graphs
• The weak Goldbach conjecture
• Transitive sets in Euclidean Ramsey theory
• Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets

Cited in

(16)

• On the Frattinidual of Doerk and Hauck
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• Bounds on Borsuk numbers in distance graphs of a special type
• 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
• 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
• On Frankel’s Theorem
• On the Frankl-Rödl theorem
• All finite sets are Ramsey in the maximum norm
• Ramsey theory in the \(n\)-space with Chebyshev metric
• A Note on a Theorem of J. N. Franklin
• On a Frankl-Wilson theorem and its geometric corollaries
• Cutting corners
• Johnson graphs, their random subgraphs, and some of their extremal characteristics

This page was built for publication: On a Frankl-Wilson theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190926)