Pages that link to "Item:Q5126777"
From MaRDI portal
The following pages link to Simple juntas for shifted families (Q5126777):
Displaying 14 items.
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Rainbow matchings in k‐partite hypergraphs (Q4996918) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)
- A proof of Frankl–Kupavskii's conjecture on edge‐union condition (Q6201033) (← links)
- Improved bounds concerning the maximum degree of intersecting hypergraphs (Q6574372) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
