Applications of sparse hypergraph colorings

DOI10.1016/J.DISC.2025.114822MaRDI QIDQ6884365zbMATH OpenFDO

Authors Felix Christian Clemen

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114822

zbMATH Keywords

discrete geometryhypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites work

• A note on arrays of dots with distinct slopes
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs
• An exact result for 3-graphs
• Bounds for arrays of dots with distinct slopes or lengths
• Coloring sparse hypergraphs
• Daisies and other Turán problems
• scientific article; zbMATH DE number 2147309 (Why is no real title available?)
• scientific article; zbMATH DE number 3194619 (Why is no real title available?)
• List coloring triangle-free hypergraphs
• Maximal Independent Subsets in Steiner Systems and in Planar Sets
• New lower bound on ball packing density in high-dimensional hyperbolic spaces
• On Sets of Distances of n Points
• On the chromatic number of simple triangle-free triple systems
• Patterns of Visible and Nonvisible Lattice Points
• Sparse hypergraphs with applications to coding theory
• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• Turán numbers and switching
• Turán numbers of r-graphs on r + 1 vertices
• Two geometrical applications of the semi-random method

This page was built for publication: Applications of sparse hypergraph colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884365)