Graphs with large maximum degree containing no odd cycles of a given length.
Paul BalisterBéla BollobásOliver RiordanRichard H. SchelpPublished in: J. Comb. Theory, Ser. B (2003)
Keyphrases
- maximum number
- random graphs
- graph matching
- fixed length
- graph theory
- graph databases
- directed graph
- graph structure
- subgraph isomorphism
- information systems
- real time
- graph representation
- data sets
- total length
- graph isomorphism
- degree distribution
- structured objects
- graph theoretic
- graph partitioning
- fixed number
- graph model
- pattern mining
- probabilistic model
- search engine