The following pages link to (Q5510578):
Displaying 50 items.
- Turán numbers for 3-uniform linear paths of length 3 (Q286115) (← links)
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Arrangements of \(k\)-sets with intersection constraints (Q449216) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Multiply union families in \(\mathbb{N}^n\) (Q739052) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Local Turan property for k-graphs (Q1161763) (← links)
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (Q1687185) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- Stability on matchings in 3-uniform hypergraphs (Q2124791) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- The Turán number of \(k \cdot S_\ell \) (Q2237229) (← links)
