On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3250141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers and chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of spaces with forbidden monochromatic triangles / rank
 
Normal rank

Revision as of 14:36, 14 July 2024

scientific article
Language Label Description Also known as
English
On the number of edges in a uniform hypergraph with a range of permitted intersections
scientific article

    Statements

    Identifiers