scientific article; zbMATH DE number 19181
From MaRDI portal
Publication:3976610
[For the entire collection see Zbl 0734.00014.] Let \(G=(V,E)\) be a simple graph. A clique of \(G\) is a maximal complete subgraph of \(G\). Let \(C(G)=\{H\mid H \text{ is a clique of }G\}\); \(I(G)=| C(G)|\); \(f(p)=\max\{I(G)\mid | V(G)|=p\}\); \(f_ k(p)=\max\{I(G)\mid | V(G)|=p\), \(G\) is \(k\)-connected\}. In this paper, the value of the function \(f_ k(p)\) is determined.
Recommendations
Cited in
(26)- Cliques, minors and apex graphs
- The maximum number of cliques in dense graphs
- Clique graphs of packed graphs
- Edge-clique graphs
- The number of maximal independent sets in connected triangle-free graphs
- Clique-gated graphs
- On clique convergent graphs
- A note on simplicial cliques
- On cliques and bicliques
- The sum of degrees in cliques
- The clique density theorem
- Odd pairs of cliques
- Cliques in k-connected graphs
- scientific article; zbMATH DE number 4156479 (Why is no real title available?)
- scientific article; zbMATH DE number 4073007 (Why is no real title available?)
- On replete graphs
- A survey on clique graphs
- On cliques in edge-regular graphs
- scientific article; zbMATH DE number 5207 (Why is no real title available?)
- scientific article; zbMATH DE number 4116571 (Why is no real title available?)
- scientific article; zbMATH DE number 2096431 (Why is no real title available?)
- On cliques in graphs
- Strong cliques in vertex‐transitive graphs
- The typical structure of graphs with no large cliques
- Graphs in which the neighborhoods of all vertices are clique extensions of grids
- On the maximum number of cliques in a graph
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 Q3976610)
