On the number of complete subgraphs and circuits contained in graphs
From MaRDI portal
(Redirected from Publication:5564136)
Recommendations
Cited in
(38)- scientific article; zbMATH DE number 3465354 (Why is no real title available?)
- How many triangles can a graph have?
- 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
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- scientific article; zbMATH DE number 3204304 (Why is no real title available?)
- On the number of connected subgraphs of graphs
- On defining numbers of circular complete graphs
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- A Remark on the Number of Complete and Empty Subgraphs
- Independent sets in graphs
- Large joints in graphs
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Nearly \(k\)-distance sets
- On the complete subgraphs of graphs defined by systems of sets
- Nearly k-distance sets
- Complete subgraphs in connected graphs and its application to spectral moment
- Bounds on the number of complete subgraphs
- Cliques in graphs with bounded minimum degree
- Maximal chordal subgraphs
- Joints in graphs
- On the structure of linear graphs
- On the maximum number of cliques in a graph
- The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
- Short proofs of some extremal results. III
- On the number of monotone sequences
- On the KŁR conjecture in random graphs
- A note on Turán's theorem
- Packing triangles in \(K_4\)-free graphs
- More on Nosal's spectral theorem: books and 4-cycles
- The number of cliques in graphs of given order and size
- Supersaturation problem for color-critical graphs
- The number of additive triples in subsets of abelian groups
- On stability of the Erdős-Rademacher problem
- Asymptotic structure of graphs with the minimum number of triangles
- 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)
