A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree.
Tom KellyDaniela KühnDeryk OsthusPublished in: CoRR (2021)
Keyphrases
- special case
- random graphs
- low degree
- computational complexity
- pairwise
- np hard
- graph matching
- approximation algorithms
- graph structure
- neural network
- directed graph
- graph theory
- graph representation
- maximum number
- graph structures
- graph theoretic
- series parallel
- graph model
- graph isomorphism
- degree distribution
- weighted graph
- bounded treewidth
- graph databases
- real time
- search algorithm
- data sets