Extremal problems concerning Kneser-graphs

DOI10.1016/0095-8956(86)90084-5zbMath0564.05002OpenAlexW2027882009MaRDI QIDQ1057858

Zoltan Fueredi, Peter Frankl

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90084-5

zbMATH Keywords

intersectionsubsets

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Related Items

On the structure of large sum-free sets of integers, Cross-intersecting families of finite sets, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Sharp bounds for the chromatic number of random Kneser graphs, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, Intersection theorems for multisets, Some good characterization results relating to the Kőnig-Egerváry theorem, Unnamed Item, Extremal problems in hypergraph colourings, On the boxicity of Kneser graphs and complements of line graphs, Trivial colors in colorings of Kneser graphs, On a biased edge isoperimetric inequality for the discrete cube, Independence number of products of Kneser graphs, A note on induced cycles in Kneser graphs, Shifts of the stable Kneser graphs and hom-idempotence, The Chromatic Number of Kneser Hypergraphs, Unnamed Item, Tight bounds for Katona's shadow intersection theorem, Long induced paths and cycles in Kneser graphs, On the union of intersecting families, Graph products and the chromatic difference sequence of vertex-transitive graphs, The multichromatic numbers of some Kneser graphs, On the diameter of Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• The exact bound in the Erdős-Ko-Rado theorem
• Supersaturated graphs and hypergraphs
• n-tuple colorings and associated graphs
• On Sperner families satisfying an additional condition
• A short proof of Kneser's conjecture
• The chromatic number and other functions of the lexicographic product
• A generalization of the Erdős-Ko-Rado theorem on finite set systems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the chromatic number of the general Kneser-graph
• The Chromatic Number of Kneser Hypergraphs
• Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem
• On a Topological Generalization of a Theorem of Tverberg
• The Ramsey number for stripes
• The Complexity of Near-Optimal Graph Coloring
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Two Results Concerning Multicoloring
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets