On the number of complete subgraphs and circuits contained in graphs
From MaRDI portal
Publication:5564136
DOI10.21136/CPM.1969.108598zbMATH Open0177.52502OpenAlexW2735975271MaRDI QIDQ5564136
Publication date: 1969
Full work available at URL: https://doi.org/10.21136/cpm.1969.108598
Related Items (30)
On defining numbers of circular complete graphs ⋮ Complete subgraphs in connected graphs and its application to spectral moment ⋮ Large joints in graphs ⋮ Maximizing the number of independent sets of fixed size in connected graphs with given independence number ⋮ Nearly \(k\)-distance sets ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ On stability of the Erdős-Rademacher problem ⋮ The number of additive triples in subsets of abelian groups ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Nearly \(k\)-distance sets ⋮ On the maximal number of certain subgraphs in \(K_ r\)-free graphs ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the number of monotone sequences ⋮ Joints in graphs ⋮ Independent sets in graphs ⋮ Supersaturation problem for color-critical graphs ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ On the number of connected subgraphs of graphs ⋮ Bounds on the number of complete subgraphs ⋮ Packing triangles in \(K_4\)-free graphs ⋮ Maximal chordal subgraphs ⋮ A note on Turán's theorem ⋮ On the maximum number of cliques in a graph ⋮ The number of cliques in graphs of given order and size ⋮ Short proofs of some extremal results III ⋮ Bounding the number of circuits of a graph ⋮ A Remark on the Number of Complete and Empty Subgraphs ⋮ Cliques in graphs with bounded minimum degree ⋮ On the complete subgraphs of graphs defined by systems of sets
This page was built for publication: On the number of complete subgraphs and circuits contained in graphs
