On clique values identities and mantel-type theorems

DOI10.22108/toc.2020.119553.1680zbMath1453.05070OpenAlexW3036438552MaRDI QIDQ5139344

Hossein Teimoori Faal

Publication date: 8 December 2020

Full work available at URL: https://doaj.org/article/f64c7847eb7e4b8d9a570d7eaec6c5e2

zbMATH Keywords

reconstruction problemhandshaking lemmaclique value identityvertex-deck

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• The number of triangles in a \(K_ 4\)-free graph
• Bounds on the number of complete subgraphs
• The maximum number of triangles in a \(K_4\)-free graph
• The weighted version of the handshaking lemma with an application
• The number of cliques in graphs of given order and size
• On the Minimal Density of Triangles in Graphs
• Turan's Graph Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On clique values identities and mantel-type theorems