Connected τ -critical hypergraphs of minimal size
A hypergraph $\mathscr{H}$ is $τ$ -critical if $τ (\mathscr{H}-E) < τ (\mathscr{H})$ for every edge $E ∈\mathscr{H}$, where $τ (\mathscr{H})$ denotes the transversal number of $\mathscr{H}$. It can be shown that a connected $τ$ -critical hypergraph $\mathscr{H}$ has at least $2τ (\mathscr{H})-1$...
Main Author: | Matěj Stehlík |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3397/pdf |
Similar Items
-
Hamiltonian Chains in Hypergraphs
by: Gyula Y. Katona
Published: (2005-01-01) -
Discrepancy of Products of Hypergraphs
by: Benjamin Doerr, et al.
Published: (2005-01-01) -
A sufficient condition for bicolorable hypergraphs
by: David Défossez
Published: (2005-01-01) -
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
by: Alexandre Bazin, et al.
Published: (2023-04-01) -
Hypertree-Width and Related Hypergraph Invariants
by: Isolde Adler, et al.
Published: (2005-01-01)