Pages that link to "Item:Q2411798"
From MaRDI portal
The following pages link to On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798):
Displaying 11 items.
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- A note on \(G\)-intersecting families (Q1861255) (← links)
- Signatures of extremal 2-unifrom hypergraphs (Q2134319) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
