On the minimum size of 4-uniform hypergraphs without property B

DOI10.1016/J.DAM.2011.11.035MaRDI QIDQ2434735zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Patric R. J. Östergård

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

zbMATH Keywords

graph coloringhypergraphproperty \(B\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Coloring four-uniform hypergraphs on nine vertices
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• scientific article; zbMATH DE number 11977
• Extremal problems for colourings of uniform hypergraphs
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites work

• A new lower bound for the football pool problem for six matches
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• Classification algorithms for codes and designs
• scientific article; zbMATH DE number 11977 (Why is no real title available?)
• scientific article; zbMATH DE number 3485832 (Why is no real title available?)
• scientific article; zbMATH DE number 1317271 (Why is no real title available?)
• scientific article; zbMATH DE number 786170 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• Improving bounds on the football pool problem by integer programming and high-throughput computing
• Intersection Inequalities for the Covering Problem
• Isomorph-Free Exhaustive Generation
• On A Combinatorial Problem III
• On A Combinatorial Problem of Erdös
• On a property of families of sets
• On Property B of Families of Sets
• 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
• The CRC handbook of combinatorial designs
• The football pool problem for 5 matches

Cited in

(13)

• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
• 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
• scientific article; zbMATH DE number 11977 (Why is no real title available?)
• On the construction of non-2-colorable uniform hypergraphs
• On hypercube packings, blocking sets and a covering problem
• scientific article; zbMATH DE number 918337 (Why is no real title available?)
• Improved Bounds for Uniform Hypergraphs without Property B
• Extremal problems in hypergraph colourings
• Coloring four-uniform hypergraphs on nine vertices
• scientific article; zbMATH DE number 2188343 (Why is no real title available?)

Describes a project that uses

Uses Software

• nauty

This page was built for publication: On the minimum size of 4-uniform hypergraphs without property \(B\)

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