On the minimum size of tight hypergraphs

DOI10.1002/JGT.3190160405zbMath0776.05079OpenAlexW2047307924MaRDI QIDQ4014271

Javier Bracho, Jorge Luis Arocha, Víctor Neumann-Lara

Publication date: 5 October 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160405

zbMATH Keywords

tight hypergraphsminimal embeddings

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Null and non-rainbow colorings of projective plane and sphere triangulations ⋮ Maximum number of colors in hypertrees of bounded degree ⋮ Looseness width of 5-connected triangulations on the torus ⋮ Some heterochromatic theorems for matroids ⋮ On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids ⋮ The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments ⋮ Maximum number of colors: C-coloring and related problems ⋮ On a heterochromatic number for hypercubes ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Smallest set-transversals of \(k\)-partitions ⋮ Looseness and independence number of triangulations on closed surfaces ⋮ Circulant tournaments of prime order are tight ⋮ Daisy structure in Desarguesian projective planes ⋮ Proper colorings of plane quadrangulations without rainbow faces ⋮ The acyclic disconnection of a digraph ⋮ Points surrounding the origin ⋮ Tightness problems in the plane ⋮ An anti-Ramsey theorem on cycles ⋮ Looseness ranges of triangulations on closed surfaces ⋮ Approximability of the upper chromatic number of hypergraphs

Cites Work

• The acyclic disconnection of a digraph

This page was built for publication: On the minimum size of tight hypergraphs