𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum number of q-cliques in a graph with no p-clique

✍ Scribed by Steven Roman

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
805 KB
Volume
14
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The maximum number of cliques in dense g
The maximum number of cliques in dense graphs
✍ Bruce Hedman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If Β’o(G)>~Β½ ]GI, then G has at most 2 tΒ°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co

On the number of distinct minimal clique
On the number of distinct minimal clique partitions and clique covers of a line graph
✍ Sean McGuinness; Rolf Rees πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

Covering the cliques of a graph with ver
Covering the cliques of a graph with vertices
✍ Paul ErdΕ‘s; Tibor Gallai; Zsolt Tuza πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.