On the Frankl–Rödl theorem (Q4613521): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the chromatic number of an infinitesimal plane layer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Groups in Euclidean Ramsey Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: All regular polytopes are Ramsey / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Triangles are Ramsey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partition Property of Simplices in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space with a forbidden regular simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of space with forbidden regular simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with large chromatic number and arbitrary girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the chromatic numbers of distance graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges of a uniform hypergraph with a range of allowed intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in a uniform hypergraph with a range of permitted intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Borsuk's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space with forbidden equilateral triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New estimates in the problem of the number of edges in a hypergraph with forbidden intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound in extremal combinatorics / rank
 
Normal rank

Revision as of 00:51, 18 July 2024

scientific article; zbMATH DE number 7010390
Language Label Description Also known as
English
On the Frankl–Rödl theorem
scientific article; zbMATH DE number 7010390

    Statements

    On the Frankl–Rödl theorem (English)
    0 references
    0 references
    1 February 2019
    0 references
    Frankl-Rödl theorem
    0 references
    Euclidean Ramsey theory
    0 references
    distance graph
    0 references
    chromatic number
    0 references
    girth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references