On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3893810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes with forbidden distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thirty Essays on Geometric Graph Theory / 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: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New estimates in the problem of the number of edges in a hypergraph with forbidden intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank

Revision as of 01:11, 11 July 2024

scientific article
Language Label Description Also known as
English
On the maximal number of edges in a uniform hypergraph with one forbidden intersection
scientific article

    Statements

    Identifiers