On the number of edges of a uniform hypergraph with a range of allowed intersections
From MaRDI portal
Publication:2190888
DOI10.1134/S0032946017040020zbMath1442.05143OpenAlexW2790202885MaRDI QIDQ2190888
A. E. Kupriyanov, A. V. Bobu, Andrei M. Raigorodskii
Publication date: 23 June 2020
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946017040020
Related Items (4)
Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees ⋮ On the Frankl–Rödl theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers and chromatic numbers of some distance graphs
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- On chromatic numbers of nearly Kneser distance graphs
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- New bounds for the chromatic number of a space with forbidden isosceles triangles
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- The complete intersection theorem for systems of finite sets
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On a packing and covering problem
- Forbidding just one intersection
- On set intersections
- Extremal problems and coverings of the space
- Intersection theorems with geometric consequences
- On t-designs
- Spherical codes and designs
- On a Frankl-Rödl theorem and its geometric corollaries
- The complete nontrivial-intersection theorem for systems of finite sets
- Chromatic numbers of spaces with forbidden monochromatic triangles
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On the chromatic number of Euclidean space with two forbidden distances
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- On chromatic numbers of close-to-Kneser distance graphs
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Improvements of the Frankl-Rödl theorem and geometric consequences
- 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
- Specified intersections
- Coloring some finite sets in {R}^{n}
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Forbidden Intersections
- Families of finite sets with prescribed cardinalities for pairwise intersections
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Intersection Properties of Systems of Finite Sets
- Error Detecting and Error Correcting Codes
- Combinatorial Geometry and Coding Theory*
- On the chromatic number of a space with forbidden equilateral triangle
- The realization of distances within sets in Euclidean space
This page was built for publication: On the number of edges of a uniform hypergraph with a range of allowed intersections
