A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree.
Tom KellyDaniela KühnDeryk OsthusPublished in: Comb. Probab. Comput. (2024)
Keyphrases
- special case
- computational complexity
- random graphs
- bounded treewidth
- graph theory
- weighted graph
- pairwise
- graph theoretic
- graph matching
- approximation algorithms
- graph structure
- graph isomorphism
- subgraph isomorphism
- graph representation
- graph databases
- directed graph
- pattern recognition
- bipartite graph
- learning algorithm
- data mining
- degree distribution
- neural network