The maximum number of cliques in dense graphs
From MaRDI portal
Publication:1061136
DOI10.1016/0012-365X(85)90077-9zbMath0569.05029MaRDI QIDQ1061136
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Clique graphs of packed graphs, Tree densities in sparse graph classes, Another extremal problem for Turan graphs, Unnamed Item, Constraints on the number of maximal independent sets in graphs, Stable fixed points of combinatorial threshold-linear networks, Enumeration of packed graphs, Independent sets in graphs, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, Graphs with the second largest number of maximal independent sets, Bounds For Invariants of Edge-Rings, Unnamed Item, The number of maximal independent sets in connected triangle-free graphs, The maximum clique problem
Cites Work
- Another extremal problem for Turan graphs
- The maximum number of q-cliques in a graph with no p-clique
- Parallel concepts in graph theory
- Über iterierte Clique-Graphen
- An upper bound on the size of the largest cliques in a graph
- On clique-extremal (p,q)-graphs
- Cliques in random graphs
- Determining the Stability Number of a Graph
- On the theory of graphs
- On cliques in graphs
- On cliques in graphs
