On the public citation graph
Expose-and-merge exploration and the chromatic number of a random graph
0 signed · 50 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf02579208openalex-snapshot
Sharp concentration of the chromatic number on random graphsG n, p
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50015-5openalex-snapshot
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199907)31:3<201::aid-jgt5>3.0.co;2-topenalex-snapshot
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199807)12:4<381::aid-rsa5>3.0.co;2-popenalex-snapshot
The chromatic numbers of random hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20264openalex-snapshot
Equitable coloring of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20445openalex-snapshot
Coloring random graphs online without creating monochromatic subgraphs
inferred← citeshttps://doi.org/10.1002/rsa.20824openalex-snapshot
Hypergraph coloring up to condensation
inferred← citeshttps://doi.org/10.1002/rsa.3240010404openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_11openalex-snapshot
Coloring Random Graphs — an Algorithmic Perspective
inferred← citeshttps://doi.org/10.1007/bf01375472openalex-snapshot
The chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf01531021openalex-snapshot
Undecidable statements and random graphs
inferred← citeshttps://doi.org/10.1007/bf02023002openalex-snapshot
Solving the maximum clique problem using a tabu search approach
inferred← citeshttps://doi.org/10.1007/bf02122551openalex-snapshot
The chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/s00493-016-3394-xopenalex-snapshot
Local Convergence of Random Graph Colorings
inferred← citeshttps://doi.org/10.1007/s00493-021-4236-zopenalex-snapshot
Lower Bounds on the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90149-copenalex-snapshot
On the independence number of random graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50008-7openalex-snapshot
10.1016/b978-044488002-4/50008-7
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.019openalex-snapshot
A note on the chromatic number of a dense random graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.09.006openalex-snapshot
On the chromatic number of random regular graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548316000390openalex-snapshot
Planting Colourings Silently
inferred← citeshttps://doi.org/10.1017/s0963548318000251openalex-snapshot
On the Number of Solutions in Random Graphk-Colouring
inferred← citeshttps://doi.org/10.1017/s0963548399004095openalex-snapshot
On the Choice Number of Random Hypergraphs
inferred← citeshttps://doi.org/10.1090/memo/1274openalex-snapshot
The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
inferred← citeshttps://doi.org/10.1093/imrn/rnv333openalex-snapshot
The Chromatic Number of Random Graphs for Most Average Degrees
inferred← citeshttps://doi.org/10.1109/focs.2013.48openalex-snapshot
Chasing the K-Colorability Threshold
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646109openalex-snapshot
The analysis of a list-coloring algorithm on a random graph
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16427.xopenalex-snapshot
Orders of Induced Subgraphs in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973082.13openalex-snapshot
Coloring random graphs online without creating monochromatic subgraphs
inferred← citeshttps://doi.org/10.1137/140980181openalex-snapshot
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs
inferred← citeshttps://doi.org/10.1137/22m1544476openalex-snapshot
On the Chromatic Number of Random Regular Hypergraphs
inferred← citeshttps://doi.org/10.37236/3337openalex-snapshot
Upper-Bounding the $k$-Colorability Threshold by Counting Covers
inferred← citeshttps://doi.org/10.3929/ethz-a-007230480openalex-snapshot
Ramsey games in random graphs
inferred← citeshttps://doi.org/10.4310/joc.2018.v9.n3.a1openalex-snapshot
Bounded monochromatic components for random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4287openalex-snapshot
On the chromatic number of random regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04191openalex-snapshot
On the number of solutions in random graph $k$-colouring
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.