The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs

DOI10.1016/j.disc.2016.05.025zbMath1339.05194arXiv1408.3197OpenAlexW1555013930MaRDI QIDQ2629296

Luis Montejano, Juan Carlos Díaz-Patiño, Gabriela Araujo-Pardo, Deborah Oliveros

Publication date: 5 July 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.3197

zbMATH Keywords

fractional chromatic numberextremal graph theoryKneser hypergraphsErdős-Ko-Rado\((p, q)\)-property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• Über eine Variante zum Hellyschen Satz
• Arc coverings of graphs
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• On Sperner families satisfying an additional condition
• Algorithmic graph theory and perfect graphs
• Hypergraph Turán numbers of linear cycles
• On Erdős' extremal problem on matchings in hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs