A note on the maximum number of triangles in a C5-free graph.
Beka ErgemlidzeAbhishek MethukuNika SaliaErvin GyöriPublished in: J. Graph Theory (2019)
Keyphrases
- maximum number
- massive graphs
- graph structure
- graph representation
- random walk
- graph theoretic
- graph theory
- graph model
- bipartite graph
- weighted graph
- graph matching
- directed graph
- connected components
- graph based algorithm
- stable set
- graph mining
- graph databases
- delaunay triangulation
- dependency graph
- structured data