Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
A spectral technique for coloring random 3-colorable graphs
Noga Alon
, Nabil Kahale
Research output
:
Contribution to journal
›
Article
›
peer-review
113
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A spectral technique for coloring random 3-colorable graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
3-colorable Graphs
100%
3-coloring
50%
Absolute Constant
50%
Almost Surely
50%
Colour Classes
100%
High Probability
50%
Implementation Results
50%
K-coloring
50%
Polynomial-time Algorithm
50%
Similarity Model
50%
Spectral Techniques
100%
Mathematics
Absolute Constant
33%
Colorable Graph
100%
Edge
33%
Polynomial Time
33%
Probability Theory
66%