scientific article; zbMATH DE number 3572211
From MaRDI portal
Publication:4143339
Cited in
(7)- Intersection properties of boxes. I: An upper-bound theorem
- A new Turán-type theorem for cliques in graphs
- Many cliques with few edges and bounded maximum degree
- Many triangles with few edges
- The maximum number of complete subgraphs in a graph with given maximum degree
- Independent sets in graphs
- Efficient enumeration of cliques in graphs with bounded maximum degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143339)