Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Frantisek FranekVojtech RödlPublished in: Graphs Comb. (1992)
Keyphrases
- graph mining
- graph databases
- graph properties
- labeled graphs
- subgraph isomorphism
- subgraph matching
- maximum common subgraph
- reachability queries
- subgraph mining
- data structure
- graph structures
- graph data
- graph matching
- connected subgraphs
- maximum clique
- graph structure
- graph patterns
- topological information
- graph theoretic
- maximal cliques
- graph representation
- directed graph
- quasi cliques
- neural network