Applications of Sparse Hypergraph Colorings
Felix Christian Clemen

TL;DR
This paper explores applications of sparse hypergraph colorings to improve bounds in extremal combinatorics problems, including grid point sets with unique slopes and Turán densities of specific hypergraphs, demonstrating novel lower bounds.
Contribution
The paper introduces new lower bounds for independence numbers and Turán densities using hypergraph coloring results, advancing understanding in extremal combinatorics.
Findings
Improved lower bound for the size of point sets with unique slopes: g(n)=Ω(n^{2/3} (log log n)^{1/3} / log^{1/3} n).
Enhanced asymptotic bound for Turán density of H^r_3: Ω(r^{-2} log^{1/2} r).
Demonstrates the application of hypergraph coloring results to specific combinatorial problems.
Abstract
Many problems in extremal combinatorics can be reduced to determining the independence number of a specific auxiliary hypergraph. We present two such problems, one from discrete geometry and one from hypergraph Tur\'an theory. Using results on hypergraph colorings by Cooper-Mubayi and Li-Postle, we demonstrate that for those two problems the trivial lower bound on the independence number can be improved upon: Erd\H{o}s, Graham, Ruzsa and Taylor asked to determine the largest size, denoted by , of a subset of the grid such that every pair of points in span a different slope. Improving on a lower bound by Zhang from 1993, we show that Let denote an -graph with vertices and edges. Recently, Sidorenko proved the following lower bounds for the Tur\'an density of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research
