On the public citation graph
An asymptotically tight bound on the adaptable chromatic number
0 signed · 33 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.1002/(sici)1097-0118(199906)31:2<149::aid-jgt8>3.0.co;2-#openalex-snapshot
The list colouring constants
inferredcites →https://doi.org/10.1002/jgt.10054openalex-snapshot
On a list coloring conjecture of Reed
inferredcites →https://doi.org/10.1002/jgt.20391openalex-snapshot
Adapted list coloring of planar graphs
inferredcites →https://doi.org/10.1006/jctb.2002.2110openalex-snapshot
Asymptotically the List Colouring Constants Are 1
inferredcites →https://doi.org/10.1007/978-3-642-04016-0openalex-snapshot
Graph Colouring and the Probabilistic Method
inferredcites →https://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
inferredcites →https://doi.org/10.1016/j.disc.2003.06.016openalex-snapshot
Chromatic capacities of graphs and hypergraphs
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.015openalex-snapshot
On the adaptable chromatic number of graphs
inferredcites →https://doi.org/10.1016/j.endm.2007.01.057openalex-snapshot
Matrix Partitions with Finitely Many Obstructions
inferredcites →https://doi.org/10.1016/s0012-365x(98)00323-9openalex-snapshot
Split and balanced colorings of complete graphs
inferredcites →https://doi.org/10.1016/s0012-365x(99)00219-8openalex-snapshot
On the upper chromatic numbers of the reals
inferredcites →https://doi.org/10.1017/s0963548301004758openalex-snapshot
A Note on Vertex List Colouring
inferredcites →https://doi.org/10.1137/070698385openalex-snapshot
Adapted List Coloring of Graphs and Hypergraphs
inferredcites →https://doi.org/10.1137/s0097539703427197openalex-snapshot
Full Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/1536414.1536462openalex-snapshot
A constructive proof of the Lovász local lemma
inferredcites →https://doi.org/10.1145/1667053.1667060openalex-snapshot
A constructive proof of the general lovász local lemma
inferredcites →https://doi.org/10.1145/380752.380840openalex-snapshot
Colouring graphs when the number of colours is nearly the maximum degree
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22011openalex-snapshot
The Adaptable Chromatic Number and the Chromatic Number
inferred← citeshttps://doi.org/10.1002/jgt.22956openalex-snapshot
Adaptable and conflict colouring multigraphs with no cycles of length three or four
inferred← citeshttps://doi.org/10.1002/jgt.23025openalex-snapshot
Single-conflict colorings of degenerate graphs
inferred← citeshttps://doi.org/10.1002/rsa.21051openalex-snapshot
Colorings, transversals, and local sparsity
inferred← citeshttps://doi.org/10.1002/rsa.70012openalex-snapshot
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1833-0openalex-snapshot
On Color Critical Graphs with Large Adaptable Chromatic Numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2011.06.016openalex-snapshot
The adaptable choosability number grows with the choosability number
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113973openalex-snapshot
Cooperative coloring of some graph families
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.48550/arxiv.2003.05233openalex-snapshot
Colourings, transversals and local sparsity
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.