Orthogonal partitions and covering of graphs

DOI10.21136/cmj.1980.101696zbMath0456.05051OpenAlexW3048359257MaRDI QIDQ3904638

Svatopluk Poljak, Vojtěch Rödl

Publication date: 1980

Full work available at URL: https://eudml.org/doc/13215

zbMATH Keywords

Latin squareschromatic numbergraph productsstable setsintersection numbercovering of graphsorthogonal partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Sperner capacities ⋮ On quorum systems for group resources allocation ⋮ On the extremal combinatorics of the Hamming space ⋮ Intersection number and capacities of graphs ⋮ Graphs of small dimensions ⋮ Representations of disjoint unions of complete graphs ⋮ On the maximum number of qualitative independent partitions ⋮ Strong qualitative independence. ⋮ The dimension of sums of graphs ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ How to guess two letters correctly ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ Dimension of the sum of several copies of a graph ⋮ On qualitatively independent partitions and related problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• On set systems determined by intersections
• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Representation of a Graph by Set Intersections