Pages that link to "Item:Q2888870"
From MaRDI portal
The following pages link to The size of a hypergraph and its matching number (Q2888870):
Displaying 50 items.
- Möbius-Walsh correlation bounds and an estimate of Mauduit and Rivat (Q351280) (← links)
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Intersection theorems for multisets (Q896069) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← 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)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number (Q2222927) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- On Erdős' extremal problem on matchings in hypergraphs (Q2439573) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- On the maximum number of edges in a triple system not containing a disjoint family of a given size (Q2883857) (← links)
- The structure of large intersecting families (Q2970053) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- A problem on complements and disjoint edges in hypergraph (Q3900108) (← links)
- (Q4558081) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- Rainbow matchings in k‐partite hypergraphs (Q4996918) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)