Bounds for the ramsey number of a disconnected graph versus any graph.
Ronald J. GouldMichael S. JacobsonPublished in: J. Graph Theory (1982)
Keyphrases
- graph representation
- small number
- graph structure
- random graphs
- connected graphs
- undirected graph
- random walk
- graph matching
- structured data
- directed graph
- computational complexity
- edge weights
- constant factor
- graph theory
- bipartite graph
- neural network
- lower bound
- graph based algorithm
- stable set
- graph search
- graph construction
- polynomial time complexity
- nodes of a graph
- graph theoretic
- maximum number
- graph databases
- directed acyclic graph
- weighted graph
- error bounds
- complex networks
- np complete
- upper bound
- probabilistic model