On Independent Complete Subgraphs in a Graph
From MaRDI portal
Publication:5533020
DOI10.4153/CJM-1968-012-xzbMath0153.54201OpenAlexW2335703770MaRDI QIDQ5533020
Publication date: 1968
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1968-012-x
Related Items (22)
The Turán numbers of special forests ⋮ The Turán number of disjoint copies of paths ⋮ The Turán number of the graph 3P5 ⋮ Extremal graphs for edge blow-up of graphs ⋮ Generalized Turán results for intersecting cliques ⋮ Turán numbers for disjoint paths ⋮ Generalized Turán numbers for the edge blow-up of a graph ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Extremal numbers of disjoint triangles in \(r\)-partite graphs ⋮ The extremal function for partial bipartite tilings ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ Spectral extremal graphs for disjoint cliques ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Disjoint unions of complete minors ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ The Turán number of star forests ⋮ Degrees and matchings ⋮ The Turań number of \(2P_7\) ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ Extremal graphs for two vertex-disjoint copies of a clique
This page was built for publication: On Independent Complete Subgraphs in a Graph
