scientific article; zbMATH DE number 863476
From MaRDI portal
Publication:4871755
zbMath0859.05063MaRDI QIDQ4871755
Publication date: 7 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65)
Related Items (35)
Spanning trees in random regular uniform hypergraphs ⋮ Complexity aspects of generalized Helly hypergraphs ⋮ Minimal connected \(\tau\)-critical hypergraphs ⋮ On neighborhood-Helly graphs ⋮ Four results about self-blocking clutters ⋮ On the associated primes and the depth of the second power of squarefree monomial ideals ⋮ On some graph classes related to perfect graphs: a survey ⋮ Exchange Properties of Finite Set-Systems ⋮ Uniform clutters and dominating sets of graphs ⋮ Equivalence between hypergraph convexities ⋮ Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials ⋮ Computing simple-path convex hulls in hypergraphs ⋮ Robust equilibria in tournaments ⋮ Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs ⋮ Decomposable convexities in graphs and hypergraphs ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Standard graded vertex cover algebras, cycles and leaves ⋮ Envelopes and clutters ⋮ Maximally edge-connected hypergraphs ⋮ A threshold result for loose Hamiltonicity in random regular uniform hypergraphs ⋮ Membership criteria and containments of powers of monomial ideals ⋮ A sufficient condition for the bicolorability of a hypergraph ⋮ On the complexity of recognizing directed path families ⋮ Minors of simplicial complexes ⋮ Structure of large random hypergraphs ⋮ An algorithm for source location in directed graphs ⋮ Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ On axioms constituting the foundation of hypergraph theory ⋮ Connected colourings of complete graphs and hypergraphs ⋮ Trees and $n$-Good Hypergraphs ⋮ Unnamed Item ⋮ Canonical and monophonic convexities in hypergraphs ⋮ On balanced graphs ⋮ A hypergraph version of the Gallai-Edmonds Theorem ⋮ Recognizing clique graphs of directed edge path graphs
This page was built for publication:
