On the number of complete subgraphs and circuits contained in graphs

DOI10.21136/CPM.1969.108598zbMATH Open0177.52502OpenAlexW2735975271MaRDI QIDQ5564136FDOQ5564136

Authors: P. Erdős 

Publication date: 1969

Full work available at URL: https://doi.org/10.21136/cpm.1969.108598

Recommendations

• scientific article; zbMATH DE number 3188526
• On a problem in extremal graph theory
• On the structure of linear graphs
• scientific article; zbMATH DE number 3204304
• scientific article; zbMATH DE number 4196017

zbMATH Keywords

topology

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cited In (36)

• Short proofs of some extremal results III
• Title not available (Why is that?)
• Extremal problems for the \(p\)-spectral radius of graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On a problem in extremal graph theory
• Title not available (Why is that?)
• Maximizing the number of independent sets of fixed size in connected graphs with given independence number
• On the number of connected subgraphs of graphs
• Title not available (Why is that?)
• On defining numbers of circular complete graphs
• A Remark on the Number of Complete and Empty Subgraphs
• Nearly \(k\)-distance sets
• Independent sets in graphs
• On the complete subgraphs of graphs defined by systems of sets
• Large joints in graphs
• Nearly \(k\)-distance sets
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Complete subgraphs in connected graphs and its application to spectral moment
• Cliques in graphs with bounded minimum degree
• Bounds on the number of complete subgraphs
• Maximal chordal subgraphs
• On the structure of linear graphs
• Joints in graphs
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• On the maximum number of cliques in a graph
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• A note on Turán's theorem
• On the number of monotone sequences
• On the KŁR conjecture in random graphs
• Packing triangles in \(K_4\)-free graphs
• The number of cliques in graphs of given order and size
• The number of additive triples in subsets of abelian groups
• Supersaturation problem for color-critical graphs
• On stability of the Erdős-Rademacher problem
• Bounding the number of circuits of a graph
• The number of complete subgraphs of equi-partite graphs

This page was built for publication: On the number of complete subgraphs and circuits contained in graphs

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