On the number of edges in a uniform hypergraph with a range of permitted intersections
From MaRDI portal
Publication:2411798
DOI10.1134/S1064562417040160zbMath1373.05128OpenAlexW2752859745MaRDI QIDQ2411798
A. E. Kupriyanov, A. V. Bobu, Andrei M. Raigorodskii
Publication date: 25 October 2017
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562417040160
Related Items
Signatures of extremal 2-unifrom hypergraphs ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the chromatic numbers of some distance graphs ⋮ On the Frankl–Rödl theorem ⋮ Exponentially Ramsey sets ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ The number of edges in induced subgraphs of some distance graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers and chromatic numbers of some distance graphs
- The complete intersection theorem for systems of finite sets
- Intersection theorems with geometric consequences
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Borsuk's problem and the chromatic numbers of some metric spaces
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring some finite sets in {R}^{n}
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- The realization of distances within sets in Euclidean space
