On the minimum size of 4-uniform hypergraphs without property \(B\)
From MaRDI portal
Publication:2434735
DOI10.1016/j.dam.2011.11.035zbMath1282.05173WikidataQ56444805 ScholiaQ56444805MaRDI QIDQ2434735
Publication date: 7 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.035
Related Items
Extremal problems in hypergraph colourings, Improved Bounds for Uniform Hypergraphs without Property B, On the construction of non-2-colorable uniform hypergraphs, On hypercube packings, blocking sets and a covering problem, On colorings of 3-homogeneous hypergraphs in 3 colors, On the chromatic number of generalized Kneser graphs and Hadamard matrices, DP-colorings of hypergraphs, On the Erdős-Hajnal problem for 3-uniform hypergraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification algorithms for codes and designs
- A new lower bound for the football pool problem for six matches
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- On Property B of Families of Sets
- Isomorph-Free Exhaustive Generation
- On the size of optimal binary codes of length 9 and covering radius 1
- Several new lower bounds on the size of codes with covering radius one
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- The football pool problem for 5 matches
- Intersection Inequalities for the Covering Problem
- On A Combinatorial Problem of Erdös
- On A Combinatorial Problem III
- On a property of families of sets