Almost all graphs with 2.522 n edges are not 3-colorable.
Dimitris AchlioptasMichael MolloyPublished in: Electron. J. Comb. (1999)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- graph matching
- edge weights
- spectral embedding
- graph theory
- graph mining
- graph theoretic
- directed edges
- adjacency matrix
- graph clustering
- graph representation
- graph databases
- edge information
- graph structure
- shortest path
- edge map
- minimum cost
- edge detector
- graph construction
- graph structures
- connected components
- image edges
- vertex set
- structured objects
- input image
- image processing