On bounds for size Ramsey numbers of a complete tripartite graph.
Izolda GorgolPublished in: Discret. Math. (1997)
Keyphrases
- lower bound
- maximal cliques
- graph structure
- spanning tree
- connected components
- graph theory
- worst case bounds
- random walk
- graph model
- graph matching
- graph based algorithm
- directed graph
- upper bound
- weighted graph
- constant factor
- stable set
- upper and lower bounds
- graph theoretic
- graph partitioning
- directed acyclic graph
- neural network
- knn
- objective function