Pages that link to "Item:Q1689040"
From MaRDI portal
The following pages link to Regular bipartite graphs and intersecting families (Q1689040):
Displayed 30 items.
- Maximum degree and diversity in intersecting hypergraphs (Q777477) (← links)
- Diversity of uniform intersecting families (Q1671747) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- Non-trivially intersecting multi-part families (Q1703447) (← links)
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- Sharp results concerning disjoint cross-intersecting families (Q1987086) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Minimum degree and diversity in intersecting antichains (Q2036583) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- Best possible bounds on the number of distinct differences in intersecting families (Q2080226) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- On the number of distinct differences in an intersecting family (Q2214062) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- Regular intersecting families (Q2334049) (← links)
- A simple proof of the Hilton-Milner theorem (Q2420488) (← links)
- Almost intersecting families (Q2662348) (← links)
- Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems (Q2694281) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Diversity (Q5918313) (← links)
- Uniform intersecting families with large covering number (Q6170804) (← links)
- Improved bounds on the maximum diversity of intersecting families (Q6201878) (← links)