Pages that link to "Item:Q5530478"
From MaRDI portal
The following pages link to On chromatic number of graphs and set-systems (Q5530478):
Displaying 50 items.
- The partite construction and Ramsey set systems (Q1119640) (← links)
- Connectivity and chromatic number of infinite graphs (Q1120588) (← links)
- Chromatically optimal rigid graphs (Q1123199) (← links)
- Erdős-Hajnal well-orderings and n-degenerate graphs (Q1143403) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- Families of sets having property B (Q1156131) (← links)
- Amalgamation of matroids and its applications (Q1158433) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- Partitions of finite relational and set systems (Q1239324) (← links)
- Le nombre minimal de colorations d'un hypergraphe k-chromatique (Q1255502) (← links)
- A note on hypergraphs with the Helly-property (Q1255970) (← links)
- A short proof of the existence of highly chromatic hypergraphs without short cycles (Q1260043) (← links)
- Unbalanced Steiner triple systems (Q1323826) (← links)
- Linear spaces with many small lines (Q1329350) (← links)
- Problems and results in discrete mathematics (Q1344612) (← links)
- The use of elementary substructures in combinatorics (Q1344620) (← links)
- Compactness and finite equivalence of infinite digraphs (Q1356449) (← links)
- A class of edge critical 4-chromatic graphs (Q1359372) (← links)
- Two remarks on the coloring number (Q1362106) (← links)
- Complete arcs in Steiner triple systems (Q1374194) (← links)
- Color-critical graphs and hypergraphs with few edges and no short cycles (Q1379816) (← links)
- Chromatic numbers and Bohr topologies (Q1398200) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- Cardinal invariants of closed graphs (Q1617948) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- Hadwiger's conjecture for uncountable graphs (Q1688268) (← links)
- Statistics of orderings (Q1688273) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
- On sets of integers with the Schur property (Q1821785) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- The dichromatic number of a digraph (Q1836671) (← links)
- On Ramsey - Turan type theorems for hypergraphs (Q1838980) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Triplication for BSTSs and uncolourability (Q1876688) (← links)
- Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717) (← links)
- Ramsey families which exclude a graph (Q1906854) (← links)
- On Taylor's problem (Q1912691) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
- On chromatic numbers of two extensions of planar graphs (Q2000818) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
