On the number of edges of a uniform hypergraph with a range of allowed intersections
From MaRDI portal
Publication:2190888
Recommendations
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Uniform hypergraphs under certain intersection constraints between hyperedges
- On the degree, size, and chromatic index of a uniform hypergraph
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
Cites work
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Chromatic numbers of spaces with forbidden monochromatic triangles
- Coloring some finite sets in R^n
- Combinatorial geometry and coding theory
- Error detecting and error correcting codes
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Extremal problems and coverings of the space
- Families of finite sets with prescribed cardinalities for pairwise intersections
- Forbidden Intersections
- Forbidding just one intersection
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3700716 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 3478749 (Why is no real title available?)
- scientific article; zbMATH DE number 3410920 (Why is no real title available?)
- Improvements of the Frankl-Rödl theorem and geometric consequences
- 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
- Independence numbers and chromatic numbers of some distance graphs
- Intersection Properties of Systems of Finite Sets
- Intersection theorems with geometric consequences
- Lower bounds for the chromatic numbers of distance graphs with large girth
- New bounds for the chromatic number of a space with forbidden isosceles triangles
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- 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
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On a Frankl-Rödl theorem and its geometric corollaries
- On a packing and covering problem
- On chromatic numbers of close-to-Kneser distance graphs
- On chromatic numbers of nearly Kneser distance graphs
- On random subgraphs of Kneser graphs and their generalizations
- On set intersections
- On t-designs
- On the chromatic number of a space with a forbidden regular simplex
- On the chromatic number of a space with forbidden equilateral triangle
- On the chromatic number of Euclidean space with two forbidden distances
- On the chromatic numbers of low-dimensional spaces
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On the stability of some Erdős-Ko-Rado type results
- Specified intersections
- Spherical codes and designs
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The realization of distances within sets in Euclidean space
Cited in
(11)- A note on G-intersecting families
- Chromatic numbers of some distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- On the Frankl-Rödl theorem
- Uniform hypergraphs under certain intersection constraints between hyperedges
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
This page was built for publication: On the number of edges of a uniform hypergraph with a range of allowed intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190888)
