On the minimum size of tight hypergraphs

DOI10.1002/JGT.3190160405zbMATH Open0776.05079OpenAlexW2047307924MaRDI QIDQ4014271FDOQ4014271

Authors Javier Bracho, Jorge L. Arocha, V. 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• The size of minimum 3-trees
• The size of minimum 3-trees: cases 0 and 1 mod 12
• Forcing large tight components in 3-graphs
• Covering and tiling hypergraphs with tight cycles
• scientific article; zbMATH DE number 4112627

Cites work

• The acyclic disconnection of a digraph

Cited in

(26)

• Looseness ranges of triangulations on closed surfaces
• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
• On a heterochromatic number for hypercubes
• A criterion for a graph to admit a tight substantial map into the Euclidean \(n\)-space
• Daisy structure in Desarguesian projective planes
• The acyclic disconnection of a digraph
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• Points surrounding the origin
• Proper colorings of plane quadrangulations without rainbow faces
• On constructing the minimal realizations of hypergraphs
• Smallest set-transversals of \(k\)-partitions
• Maximum number of colors: C-coloring and related problems
• Circulant tournaments of prime order are tight
• The size of minimum 3-trees: cases 0 and 1 mod 12
• On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
• The size of minimum 3-trees
• An anti-Ramsey theorem on cycles
• Forcing large tight components in 3-graphs
• Maximum number of colors in hypertrees of bounded degree
• Tightness problems in the plane
• Looseness and independence number of triangulations on closed surfaces
• Looseness width of 5-connected triangulations on the torus
• Some heterochromatic theorems for matroids
• Approximability of the upper chromatic number of hypergraphs
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• Null and non-rainbow colorings of projective plane and sphere triangulations

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

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