On the public citation graph
Linearly Ordered Colourings of Hypergraphs
0 signed · 51 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.1006/jagm.2001.1173openalex-snapshot
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
inferredcites →https://doi.org/10.1007/978-3-540-85363-3_5openalex-snapshot
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_11openalex-snapshot
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_17openalex-snapshot
Improved Hardness of Approximating Chromatic Number
inferredcites →https://doi.org/10.1007/bf01840398openalex-snapshot
A better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1007/s00493-005-0032-4openalex-snapshot
The Hardness of 3-Uniform Hypergraph Coloring
inferredcites →https://doi.org/10.1007/s00493-016-3383-0openalex-snapshot
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
inferredcites →https://doi.org/10.1007/s004930070013openalex-snapshot
On the Hardness of Approximating the Chromatic Number
inferredcites →https://doi.org/10.1007/s11856-017-1621-9openalex-snapshot
The wonderland of reflections
inferredcites →https://doi.org/10.1016/j.jda.2011.03.005openalex-snapshot
Graph unique-maximum and conflict-free colorings
inferredcites →https://doi.org/10.1016/s0196-6774(03)00077-4openalex-snapshot
Approximate coloring of uniform hypergraphs
inferredcites →https://doi.org/10.1137/07068062xopenalex-snapshot
Conditional Hardness for Approximate Coloring
inferredcites →https://doi.org/10.1137/1.9781611975994.86openalex-snapshot
Improved hardness for H -colourings of G -colourable graphs
inferredcites →https://doi.org/10.1137/1.9781611975994.90openalex-snapshot
Improved Inapproximability of Rainbow Coloring
inferredcites →https://doi.org/10.1137/1.9781611976465openalex-snapshot
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611977073.50openalex-snapshot
Combinatorial Gap Theorem and Reductions between Promise CSPs
inferredcites →https://doi.org/10.1137/120880471openalex-snapshot
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
inferredcites →https://doi.org/10.1137/19m127731xopenalex-snapshot
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
inferredcites →https://doi.org/10.1137/19m128212xopenalex-snapshot
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
inferredcites →https://doi.org/10.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0895480100376794openalex-snapshot
On the Hardness of 4-Coloring a 3-Colorable Graph
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/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1145/3001582openalex-snapshot
Coloring 3-Colorable Graphs with Less than n 1/5 Colors
inferredcites →https://doi.org/10.1145/321921.321926openalex-snapshot
The Complexity of Near-Optimal Graph Coloring
inferredcites →https://doi.org/10.1145/3457606openalex-snapshot
Algebraic Approach to Promise Constraint Satisfaction
inferredcites →https://doi.org/10.1145/3459668openalex-snapshot
The Quest for Strong Inapproximability Results with Perfect Completeness
inferredcites →https://doi.org/10.1145/3470867openalex-snapshot
The Complexity of Promise SAT on Non-Boolean Domains
inferredcites →https://doi.org/10.1145/3570909openalex-snapshot
Linearly Ordered Colourings of Hypergraphs
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.4230/dfu.vol7.15301.1openalex-snapshot
Polymorphisms, and How to Use Them
inferredcites →https://doi.org/10.4230/lipics.ccc.2016.14openalex-snapshot
New Hardness Results for Graph and Hypergraph Colorings
inferredcites →https://doi.org/10.4230/lipics.icalp.2020.62openalex-snapshot
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.4230/lipics.stacs.2021.10openalex-snapshot
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case
inferredcites →https://doi.org/10.48550/arxiv.2205.14719openalex-snapshot
A note on hardness of promise hypergraph colouring
inferredcites →https://doi.org/10.7155/jgaa.00020openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175746openalex-snapshot
Boolean symmetric vs. functional PCSP dichotomy
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch25openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
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/3661814.3662069openalex-snapshot
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise
inferred← citeshttps://doi.org/10.1145/3673655openalex-snapshot
On the Complexity of Symmetric vs. Functional PCSPs
inferred← citeshttps://doi.org/10.1145/3698106openalex-snapshot
Solving Promise Equations over Monoids and Groups
inferred← citeshttps://doi.org/10.1145/3719007openalex-snapshot
1 -in- 3 vs . N ot -A ll -E qual : Dichotomy of a Broken Promise
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.1145/3799414openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.4171/owr/2023/58openalex-snapshot
Geometric, Algebraic and Topological Combinatorics
showing the first 11 of 12 · page through all 12
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.