The geometry and combinatorics of discrete line segment hypergraphs

DOI10.1016/j.disc.2020.111825zbMath1437.05175arXiv1807.04826OpenAlexW3003533105MaRDI QIDQ2174575

Christopher O'Neill, Shira Zerbib, Deborah Oliveros

Publication date: 21 April 2020

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

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

zbMATH Keywords

uniform hypergraphchromatic numbermatching numbercovering numberfractional coverdiscrete line segment

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

On intersecting straight line systems, On transversal numbers of intersecting straight line systems and intersecting segment systems, Intersections and circuits in sets of line segments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Über eine Variante zum Hellyschen Satz
• Ryser's conjecture for tripartite 3-graphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Packing and covering triangles in graphs
• Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
• On a conjecture of Tuza about packing and covering of triangles
• A conjecture on triangles of graphs
• Convexity in cristallographical lattices
• Transversal numbers over subsets of linear spaces
• The chromatic number of the plane is at least 5
• A generalization of Tuza's conjecture