Sparse hypergraphs with low independence number

DOI10.1007/s00493-014-3219-8zbMath1399.05168arXiv1312.0813OpenAlexW2181370180MaRDI QIDQ1705800

Dhruv Mubayi, Jeff Cooper

Publication date: 16 March 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

independence numberhypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Related Items (6)

List coloring triangle-free hypergraphs ⋮ Independent sets in hypergraphs omitting an intersection ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Defective coloring of hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Coloring the normalized Laplacian for oriented hypergraphs

Cites Work

• Unnamed Item
• On the chromatic number of simple triangle-free triple systems
• A dense infinite Sidon sequence
• Extremal uncrowded hypergraphs
• On Turan's theorem for sparse graphs
• An intersection theorem for four sets
• Turan's theorem for \(k\)-graphs
• Coloring H-free hypergraphs
• List coloring triangle-free hypergraphs
• A Lower Bound for Heilbronn'S Problem
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Sparse Parity-Check Matrices over ${GF(q)}$
• On the independence number of sparse graphs

This page was built for publication: Sparse hypergraphs with low independence number