Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph.
Frank HararyGeert C. E. PrinsPublished in: Networks (1974)
Keyphrases
- graph structure
- graph theory
- graph matching
- graph representation
- weighted graph
- graph theoretic
- graph structures
- series parallel
- graph databases
- labeled graphs
- graph mining
- directed graph
- adjacency matrix
- graph construction
- graph partitioning
- graph model
- graph clustering
- graph classification
- graph search
- graph data
- bipartite graph
- spanning tree
- evolving graphs
- minimum spanning tree
- graph theoretical
- maximum common subgraph
- directed acyclic
- graph properties
- random graphs
- random walk
- graph representations
- graph isomorphism
- undirected graph
- structural pattern recognition
- subgraph isomorphism
- inexact graph matching
- graph patterns
- graph kernels
- edge weights
- graph layout
- spectral decomposition
- graph drawing
- disk resident
- social graphs
- graph transformation
- maximum cardinality
- real world graphs
- neighborhood graph
- graph embedding
- shortest path
- finding the shortest path
- connected graphs
- massive graphs
- maximum independent set
- graphical models
- dense subgraphs
- proximity graph
- dynamic graph
- web graph
- maximum clique
- small world
- strongly connected
- topological information
- fully connected
- community discovery