Pages that link to "Item:Q4103571"
From MaRDI portal
The following pages link to SETS OF INDEPENDENT EDGES OF A HYPERGRAPH (Q4103571):
Displaying 50 items.
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- Note on matchings in 3-partite 3-uniform hypergraphs (Q512618) (← 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)
- 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)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- Intersection theorems for multisets (Q896069) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← 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)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Stability on matchings in 3-uniform hypergraphs (Q2124791) (← 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)
- On the size of shadow-added intersecting families (Q2225446) (← 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)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← 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)
- On Erdős' extremal problem on matchings in hypergraphs (Q2439573) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- Matchings in 3-uniform hypergraphs of large minimum vertex degree (Q2857450) (← links)
- On the maximum number of edges in a triple system not containing a disjoint family of a given size (Q2883857) (← links)
- The size of a hypergraph and its matching number (Q2888870) (← links)
- The structure of large intersecting families (Q2970053) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
