On the public citation graph
On chromatic number of finite set-systems
0 signed · 147 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-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot
On chromatic number of graphs and set systems
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.20166openalex-snapshot
Color critical hypergraphs with many edges
inferred← citeshttps://doi.org/10.1002/jgt.20557openalex-snapshot
Vertex colorings of graphs without short odd cycles
inferred← citeshttps://doi.org/10.1002/jgt.3190110113openalex-snapshot
On generalized graph colorings
inferred← citeshttps://doi.org/10.1006/jctb.1994.1040openalex-snapshot
The Complexity of Infinite H-Coloring
inferred← citeshttps://doi.org/10.1006/jctb.1996.1738openalex-snapshot
Some Theorems Concerning the Star Chromatic Number of a Graph
inferred← citeshttps://doi.org/10.1006/jctb.1997.1769openalex-snapshot
The Number of Dependent Arcs in an Acyclic Orientation
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_3openalex-snapshot
On the coloration of perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_64openalex-snapshot
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_69openalex-snapshot
Computing the Girth of a Planar Graph
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_43openalex-snapshot
Decidable Properties of Graphs of All-Optical Networks
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_2openalex-snapshot
The Reduced Genus of a Multigraph
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-1-4614-7254-4_13openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_4openalex-snapshot
Extremal problems for cycles in graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_11openalex-snapshot
Bounds and Extrema for Classes of Graphs and Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_63openalex-snapshot
Computing the Girth of a Planar Graph in O(n logn) Time
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_20openalex-snapshot
Computing the Girth of a Planar Graph in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_27openalex-snapshot
Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_16openalex-snapshot
A Survey of the Hadwiger-Debrunner (p, q)-problem
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_16openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_8openalex-snapshot
Partite Construction and Ramsey Space Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_9openalex-snapshot
Graham-Rothschild Parameter Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/bf00337921openalex-snapshot
On graphs that can be oriented as diagrams of ordered sets
inferred← citeshttps://doi.org/10.1007/bf01191498openalex-snapshot
Combinatorial partitions of finite posets and lattices —Ramsey lattices
inferred← citeshttps://doi.org/10.1007/bf01224952openalex-snapshot
A category-theoretical approach to hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01304871openalex-snapshot
On critical uniquely colorable graphs
inferred← citeshttps://doi.org/10.1007/bf01874387openalex-snapshot
Probabilistic methods in graph theory
inferred← citeshttps://doi.org/10.1007/bf01894789openalex-snapshot
A generalization of Kónig's theorem
inferred← citeshttps://doi.org/10.1007/bf01902363openalex-snapshot
The existence problem for colour critical linear hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01902367openalex-snapshot
The structure of critical Ramsey graphs
inferred← citeshttps://doi.org/10.1007/bf02579156openalex-snapshot
What must and what need not be contained in a graph of uncountable chromatic number?
inferred← citeshttps://doi.org/10.1007/bf02579371openalex-snapshot
Independent sets ink-chromatic graphs
inferred← citeshttps://doi.org/10.1007/bf03352991openalex-snapshot
A Class of Edge Critical 4-Chromatic Graphs
inferred← citeshttps://doi.org/10.1007/bfb0066446openalex-snapshot
The minimality of the mycielski graph
inferred← citeshttps://doi.org/10.1007/s00373-022-02607-7openalex-snapshot
New Results on k-independence of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00454-013-9545-6openalex-snapshot
Constructing Uniquely Realizable Graphs
inferred← citeshttps://doi.org/10.1007/s00493-013-2405-4openalex-snapshot
Constraints, MMSNP and expander relational structures
inferred← citeshttps://doi.org/10.1007/s00493-013-2440-1openalex-snapshot
Critical graphs without triangles: An optimum density construction
inferred← citeshttps://doi.org/10.1007/s11083-010-9163-3openalex-snapshot
Dualities and Dual Pairs in Heyting Algebras
inferred← citeshttps://doi.org/10.1007/s11856-016-1361-2openalex-snapshot
Coloring, sparseness and girth
inferred← citeshttps://doi.org/10.1007/s40590-013-0001-7openalex-snapshot
Mycielski type constructions for hypergraphs associated with fractional colorings
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90044-2openalex-snapshot
Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90121-3openalex-snapshot
On colorings of graphs without short cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90057-3openalex-snapshot
On the use of senders in generalized ramsey theory for graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90097-6openalex-snapshot
The partite construction and ramsey set systems
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90196-9openalex-snapshot
The subchromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90034-yopenalex-snapshot
Graph properties and hypergraph colourings
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00039-yopenalex-snapshot
High girth and extendability
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00139-5openalex-snapshot
Conditional chromatic numbers with forbidden cycles
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90065-2openalex-snapshot
An interpolation theorem for partitions which are complete with respect to hereditary properties
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90037-5openalex-snapshot
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90084-4openalex-snapshot
A short proof of the existence of highly chromatic hypergraphs without short cycles
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90047-7openalex-snapshot
The enumeration problem for color critical linear hypergraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90090-8openalex-snapshot
Critical hypergraphs for the weak chromatic number
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00003-aopenalex-snapshot
Scheduling independent tasks with multiple modes
inferred← citeshttps://doi.org/10.1016/0166-218x(96)00096-0openalex-snapshot
The complexity of generalized graph colorings
inferred← citeshttps://doi.org/10.1016/b978-0-444-86893-0.50020-6openalex-snapshot
SELECTIVITY OF HYPERGRAPHS
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50009-9openalex-snapshot
10.1016/b978-044488002-4/50009-9
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.aml.2010.10.032openalex-snapshot
The fractional chromatic number of Zykov products of graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.dam.2013.12.008openalex-snapshot
Coloring graphs without short cycles and long induced paths
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.022openalex-snapshot
On a construction of graphs with high chromatic capacity and large girth
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.011openalex-snapshot
Partitions of graphs into cographs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112980openalex-snapshot
Generalized signed graphs of large girth and large chromatic number
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.017openalex-snapshot
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.05.007openalex-snapshot
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.04.009openalex-snapshot
Hypergraph Ramsey numbers: Triangles versus cliques
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.12.004openalex-snapshot
On balanced incomplete block designs with specified weak chromatic number
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00161-6openalex-snapshot
Motivations and history of some of my conjectures
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00220-8openalex-snapshot
Compactness and finite equivalence of infinite digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00095-5openalex-snapshot
From logical gates synthesis to chromatic bicritical clutters
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70296-6openalex-snapshot
The Subchromatic Number of a Graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70376-5openalex-snapshot
The Complexity of Colouring by Infinite Vertex Transitive Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70506-5openalex-snapshot
Selective Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70740-4openalex-snapshot
Subdegrees and Chromatic Numbers of Hypergraphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(80)80009-6openalex-snapshot
2-Chromatic Steiner Quadruple Systems
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00115-5openalex-snapshot
Partitions of Graphs into Cographs
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
inferred← citeshttps://doi.org/10.1017/s0963548319000452openalex-snapshot
On subgraphs of C2k-free graphs and a problem of Kühn and Osthus
inferred← citeshttps://doi.org/10.1080/00029890.2008.11920498openalex-snapshot
Another Simple Proof of the High Girth, High Chromatic Number Theorem
inferred← citeshttps://doi.org/10.1080/00029890.2018.1521240openalex-snapshot
A Simple Construction to Prove Mycielski’s Theorem
inferred← citeshttps://doi.org/10.1080/00029890.2025.2541528openalex-snapshot
Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476560-xopenalex-snapshot
On the genus of graphs with Lick-White number 𝑘
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0507350-7openalex-snapshot
On a Probabilistic Graph-Theoretical Method
inferred← citeshttps://doi.org/10.1093/comjnl/19.2.182openalex-snapshot
On Various Algorithms for Estimating the Chromatic Number of a Graph
inferred← citeshttps://doi.org/10.1093/imrn/rnv022openalex-snapshot
Mixing Properties and the Chromatic Number of Ramanujan Complexes
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32819.xopenalex-snapshot
AMALGAMATION OF GRAPHS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1112/jlms.12987openalex-snapshot
Colouring versus density in integers and Hales–Jewett cubes
inferred← citeshttps://doi.org/10.1134/s0001434619050249openalex-snapshot
Counterexamples to Borsuk’s Conjecture with Large Girth
inferred← citeshttps://doi.org/10.1134/s106456242460249xopenalex-snapshot
On a Combinatorial Application of Ultrafilter Theory: A New Construction of Triangle-Free Graphs with Arbitrarily Large Chromatic Number
inferred← citeshttps://doi.org/10.1137/090767868openalex-snapshot
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
inferred← citeshttps://doi.org/10.1137/110832033openalex-snapshot
Computing the Girth of a Planar Graph in Linear Time
inferred← citeshttps://doi.org/10.1137/23m1553273openalex-snapshot
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz
inferred← citeshttps://doi.org/10.1137/24m1700600openalex-snapshot
\({k}\)-Independent Boolean Networks
inferred← citeshttps://doi.org/10.1137/s0895480196304994openalex-snapshot
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
inferred← citeshttps://doi.org/10.1142/s0218196706002846openalex-snapshot
INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
inferred← citeshttps://doi.org/10.1145/1868237.1868240openalex-snapshot
A faster algorithm for computing the girth of planar and bounded genus graphs
inferred← citeshttps://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferred← citeshttps://doi.org/10.11575/cdm.v9i2.62197openalex-snapshot
A short construction of highly chromatic digraphs without short cycles
inferred← citeshttps://doi.org/10.11606/d.45.2018.tde-10092018-175741openalex-snapshot
Grafos e hipergrafos com cintura e número cromático grandes
inferred← citeshttps://doi.org/10.1287/moor.12.3.522openalex-snapshot
On the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.21136/cpm.1973.108481openalex-snapshot
On uniquely colorable graphs without short cycles
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4278openalex-snapshot
Graph coloring Parameters-A Survey
inferred← citeshttps://doi.org/10.2307/121059openalex-snapshot
Permanents, Pfaffian Orientations, and Even Directed Circuits
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-9openalex-snapshot
Bounds for the smallest $k$-chromatic graphs of given girth
inferred← citeshttps://doi.org/10.37236/9689openalex-snapshot
Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization
inferred← citeshttps://doi.org/10.4153/cjm-2011-084-9openalex-snapshot
Uniquely D-colourable Digraphs with Large Girth
inferred← citeshttps://doi.org/10.4153/cmb-1975-024-0openalex-snapshot
On Property of Families of Sets
inferred← citeshttps://doi.org/10.4213/mzm12000openalex-snapshot
Контрпримеры к гипотезе Борсука, имеющие большой обхват
inferred← citeshttps://doi.org/10.4310/joc.2016.v7.n2.a11openalex-snapshot
Decomposable and indecomposable critical hypergraphs
inferred← citeshttps://doi.org/10.4310/joc.2022.v13.n1.a1openalex-snapshot
Coloring hypergraphs of low connectivity
inferred← citeshttps://doi.org/10.48550/arxiv.0710.4477openalex-snapshot
Homomorphisms and Structural Properties of Relational Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3921openalex-snapshot
Distance graphs with large chromatic number and arbitrary girth
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00061openalex-snapshot
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v18i2.73457openalex-snapshot
On Colouring Oriented Graphs of Large Girth
inferred← citeshttps://doi.org/10.70675/cae60fe0z49d9z4c30za6f1z76158ca58aa5openalex-snapshot
Coloration de graphes épars
inferred← citeshttps://doi.org/10.7151/dmgt.2291openalex-snapshot
High girth hypergraphs with unavoidable monochromatic or rainbow edges
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.