Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6473900 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
upper bound | |||
| Property / zbMATH Keywords: upper bound / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
product of cardinalities of edge sets | |||
| Property / zbMATH Keywords: product of cardinalities of edge sets / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hypergraphs | |||
| Property / zbMATH Keywords: hypergraphs / rank | |||
Normal rank | |||
Revision as of 22:04, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle |
scientific article |
Statements
Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (English)
0 references
20 August 2015
0 references
upper bound
0 references
product of cardinalities of edge sets
0 references
hypergraphs
0 references
