On the public citation graph

Coloring 3-Colorable Graphs with Less than n 1/5 Colors

0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1006/jcss.1998.1587openalex-snapshot
Zero Knowledge and the Chromatic Number
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_1openalex-snapshot
New Tools for Graph Coloring
inferredcites →https://doi.org/10.1007/bf01840398openalex-snapshot
A better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/s004930070013openalex-snapshot
On the Hardness of Approximating the Chromatic Number
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/s0020-0190(96)00190-1openalex-snapshot
An algorithm for 3-colorable graphs
inferredcites →https://doi.org/10.1109/focs.2007.13openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferredcites →https://doi.org/10.1109/focs.2012.16openalex-snapshot
Combinatorial Coloring of 3-Colorable Graphs
inferredcites →https://doi.org/10.1109/sfcs.1994.365707openalex-snapshot
A note on the θ number of Lovasz and the generalized Delsarte bound
inferredcites →https://doi.org/10.1137/07068062xopenalex-snapshot
Conditional Hardness for Approximate Coloring
inferredcites →https://doi.org/10.1137/s0097539703431391openalex-snapshot
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
inferredcites →https://doi.org/10.1137/s0895480100376794openalex-snapshot
On the Hardness of 4-Coloring a 3-Colorable Graph
inferredcites →https://doi.org/10.1145/1132516.1132548openalex-snapshot
New approximation guarantee for chromatic number
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/176584.176586openalex-snapshot
New approximation algorithms for graph coloring
inferredcites →https://doi.org/10.1145/2157.2158openalex-snapshot
Improving the performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.4230/lipics.stacs.2014.458openalex-snapshot
Coloring 3-colorable graphs with o(n^{1/5}) colors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_15openalex-snapshot
Approximately Coloring Graphs Without Long Induced Paths
inferred← citeshttps://doi.org/10.1109/focs.2017.72openalex-snapshot
The Power of Sum-of-Squares for Detecting Hidden Structures
inferred← citeshttps://doi.org/10.1109/focs.2019.00076openalex-snapshot
The Complexity of 3-Colouring H-Colourable Graphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00007openalex-snapshot
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
inferred← citeshttps://doi.org/10.1137/1.9781611975994.86openalex-snapshot
Improved hardness for H -colourings of G -colourable graphs
inferred← citeshttps://doi.org/10.1137/20m1378223openalex-snapshot
Topology and Adjunction in Promise Constraint Satisfaction
inferred← citeshttps://doi.org/10.1137/23m1552474openalex-snapshot
Robust Factorizations and Colorings of Tensor Graphs
inferred← citeshttps://doi.org/10.1137/23m155760xopenalex-snapshot
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
inferred← citeshttps://doi.org/10.1137/23m1602127openalex-snapshot
Coloring Tournaments with Few Colors: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1137/24m1638628openalex-snapshot
Semidefinite Programming and Linear Equations vs. Homomorphism Problems
inferred← citeshttps://doi.org/10.1145/3313276.3316300openalex-snapshot
Algebraic approach to promise constraint satisfaction
inferred← citeshttps://doi.org/10.1145/3457606openalex-snapshot
Algebraic Approach to Promise Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/3494539openalex-snapshot
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
inferred← citeshttps://doi.org/10.1145/3559736.3559740openalex-snapshot
An invitation to the promise constraint satisfaction problem
inferred← citeshttps://doi.org/10.1145/3564246.3585112openalex-snapshot
Approximate Graph Colouring and the Hollow Shadow
inferred← citeshttps://doi.org/10.1145/3570909openalex-snapshot
Linearly Ordered Colourings of Hypergraphs
inferred← citeshttps://doi.org/10.1145/3618260.3649635openalex-snapshot
Semidefinite Programming and Linear Equations vs. Homomorphism Problems
inferred← citeshttps://doi.org/10.1145/3618260.3649768openalex-snapshot
Better Coloring of 3-Colorable Graphs
inferred← citeshttps://doi.org/10.1145/3717823.3718137openalex-snapshot
Rounding Large Independent Sets on Expanders
inferred← citeshttps://doi.org/10.1145/3779121openalex-snapshot
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.15openalex-snapshot
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.28openalex-snapshot
Approximation Algorithms for Partially Colorable Graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.39openalex-snapshot
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.4310/cdm.2019.v2019.n1.a2openalex-snapshot
On the proof of the 2-to-2 Games Conjecture
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.