The following pages link to (Q4326650):
Displaying 23 items.
- Minimum number of affine simplices of given dimension (Q476315) (← links)
- Tolerance in Helly-type theorems (Q629843) (← links)
- On sizes of 1-cross intersecting set pair systems (Q820485) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- A note on \(\tau\)-critical linear hypergraphs (Q1376067) (← links)
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences (Q1422400) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets (Q1877683) (← links)
- A bound for 1-cross intersecting set pair systems (Q2033884) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Bollobás-type theorems for hemi-bundled two families (Q2065121) (← links)
- Set systems related to a house allocation problem (Q2182206) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets (Q2351027) (← links)
- Equality of domination and transversal numbers in hypergraphs (Q2446829) (← links)
- Lower bound on the profile of degree pairs in cross-intersecting set systems (Q2460634) (← links)
- An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph (Q4917098) (← links)
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (Q5034136) (← links)
- On the \(f\)-vectors of cutsets in the Boolean lattice (Q5929842) (← links)
- Problems and results on 1-cross-intersecting set pair systems (Q6085875) (← links)
- Saturation for the 3-uniform loose 3-cycle (Q6091820) (← links)
- Vector sum-intersection theorems (Q6172276) (← links)
