The following pages link to (Q4871755):
Displaying 36 items.
- On neighborhood-Helly graphs (Q344856) (← links)
- On the associated primes and the depth of the second power of squarefree monomial ideals (Q393525) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- Maximally edge-connected hypergraphs (Q501024) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- Minimal connected \(\tau\)-critical hypergraphs (Q855295) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Minors of simplicial complexes (Q967303) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- Four results about self-blocking clutters (Q1377860) (← links)
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701) (← links)
- Development of hypergraph theory (Q1647456) (← links)
- Structure of large random hypergraphs (Q1774214) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- Envelopes and clutters (Q1975370) (← links)
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs (Q1985454) (← links)
- Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Uniform clutters and dominating sets of graphs (Q2420426) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- A sufficient condition for the bicolorability of a hypergraph (Q2483408) (← links)
- On axioms constituting the foundation of hypergraph theory (Q2508044) (← links)
- On balanced graphs (Q2583124) (← links)
- A hypergraph version of the Gallai-Edmonds Theorem (Q3439610) (← links)
- Standard graded vertex cover algebras, cycles and leaves (Q3542001) (← links)
- Trees and $n$-Good Hypergraphs (Q4622621) (← links)
- Exchange Properties of Finite Set-Systems (Q5099106) (← links)
- (Q5708599) (← links)
- Spanning trees in random regular uniform hypergraphs (Q5886306) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials (Q6116558) (← links)
- Robust equilibria in tournaments (Q6188258) (← links)
