On Independent Complete Subgraphs in a Graph

DOI10.4153/CJM-1968-012-XMaRDI QIDQ5533020zbMATH OpenOpenAlexFDO

Authors J. W. Moon

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

zbMATH Keywords

topology

Cited in

(39)

• Degrees and matchings
• The Turán number of star forests
• Extremal graphs for two vertex-disjoint copies of a clique
• The Turán numbers of special forests
• The Turań number of \(2P_7\)
• Generalized Turán problems for disjoint copies of graphs
• The Turán number of disjoint copies of paths
• Extremal graphs for edge blow-up of graphs
• Spectral extremal graphs for disjoint cliques
• The extremal function for partial bipartite tilings
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• The Turán number of the graph 3P5
• 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
• Some exact results for non-degenerate generalized Turán problems
• Maximum cliques in a graph without disjoint given subgraph
• Spectral extremal problem on disjoint color-critical graphs
• The complete value of the Turán number of \(3K_{p+1}\)
• Spectral extremal graphs for edge blow-up of star forests
• Generalized Turán results for edge blow-up of star forests
• On the Turán number of edge blow-ups of cliques
• Maxima of the \(Q\)-index for \(3 K_3\)-free graphs
• Spectral extremal problem on t copies of -cycles
• Turán number of two vertex-disjoint copies of cliques.
• Many vertex-disjoint even cycles of fixed length in a graph
• Generalized Turán number for edge blow-up of paths and cycles
• Spectral extrema of graphs with fixed size: forbidden star forests
• Two extremal problems for 4-cycles in 4-partite graphs
• Spectral extremal results on edge blow-up of graphs
• Extremal graphs for even linear forests in bipartite graphs
• Turán numbers for vertex-disjoint triangles and pentagons
• On degree powers and counting stars in F-free graphs
• Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
• A partial edge-density version of the Corrádi-Hajnal theorem in hypergraphs
• The maximum spectral radius of k P₃-free graphs
• Disjoint unions of complete minors

This page was built for publication: On Independent Complete Subgraphs in a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5533020)