Extremal problems and coverings of the space

DOI10.1016/S0195-6698(80)80045-XzbMath0463.05043MaRDI QIDQ1153096

Peter Frankl

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic numbern-dimensional Euclidean space

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Maximum trees of finite sequences, Large cycles in generalized Johnson graphs, On the number of edges of a uniform hypergraph with a range of allowed intersections, Integer sequences without singleton intersection, On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex, On the combinatorial problems which I would most like to see solved, On Sperner families in which no k sets have an empty intersection. III, Intersection theorems with geometric consequences, Erdös–Ko–Rado Theorem—22 Years Later, Around Borsuk's hypothesis, Linear dependencies among subsets of a finite set, An extremal set theoretical characterization of some Steiner systems, Forbidding just one intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On t-designs
• A note on the realization of distances within sets in euclidean space
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• On families of finite sets no two of which intersect in a singleton
• The realization of distances within sets in Euclidean space
• On intersecting families of finite sets