Pages that link to "Item:Q1071788"
From MaRDI portal
The following pages link to Critical hypergraphs and interesting set-pair systems (Q1071788):
Displaying 35 items.
- Color the cycles (Q383778) (← links)
- Bounded degrees and prescribed distances in graphs (Q686447) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Petruska's question on planar convex sets (Q776273) (← links)
- Local constraints ensuring small representing sets (Q804606) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
- On the kernel of intersecting families (Q1106213) (← links)
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration (Q1296753) (← links)
- On conjectures of Berge and Chvátal (Q1313827) (← links)
- Inequalities for minimal covering sets in set systems of given rank (Q1329820) (← links)
- On the maximum number of points in a maximal intersecting family of finite sets (Q1705805) (← links)
- \(\mathcal{P}\)-apex graphs (Q1708380) (← links)
- Research problems from the 19th British Combinatorial Conference (Q1779507) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On two intersecting set systems and k-continuous Boolean functions (Q1820783) (← links)
- Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
- The number of \(k\)-intersections of an intersecting family of \(r\)-sets (Q1826945) (← links)
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets (Q1877683) (← links)
- The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Eckhoff's problem on convex sets in the plane (Q2049618) (← links)
- A note on kernels of intersecting families (Q2277266) (← links)
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method (Q2341076) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- Equality of domination and transversal numbers in hypergraphs (Q2446829) (← links)
- The Szemerédi-Petruska conjecture for a few small values (Q2667158) (← links)
- C-perfect hypergraphs (Q3055910) (← links)
- Intersecting Families are Essentially Contained in Juntas (Q3557506) (← links)
- A hierarchy of maximal intersecting triple systems (Q4690989) (← links)
- Load balancing in quorum systems (Q5057420) (← links)
- Matching criticality in intersecting hypergraphs (Q5236049) (← links)
- An asymptotic resolution of a conjecture of Szemerédi and Petruska (Q6041571) (← links)
- The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs (Q6166161) (← links)
