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.
- Coloring, sparseness and girth (Q312271) (← links)
- Chromatic numbers of graphs -- large gaps (Q313434) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- The list-chromatic number of infinite graphs (Q375873) (← links)
- A note on chromatic number and connectivity of infinite graphs (Q375903) (← links)
- Shift graphs on precompact families of finite sets of natural numbers (Q449133) (← links)
- What is Ramsey-equivalent to a clique? (Q462928) (← links)
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (Q466092) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Trees, ladders and graphs (Q490986) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Hedetniemi's conjecture for uncountable graphs (Q509108) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Ramsey-type results for metric spaces (Q579261) (← links)
- Ramsey varieties (Q585254) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- The list-chromatic number of infinite graphs defined on Euclidean spaces (Q633199) (← links)
- Infinitely connected subgraphs in graphs of uncountable chromatic number (Q681605) (← links)
- On a construction of graphs with high chromatic capacity and large girth (Q708406) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- Representing graphs in Steiner triple systems (Q742566) (← links)
- Ramsey-type theorems (Q751670) (← links)
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\) (Q756706) (← links)
- Hypergraph families with bounded edge cover or transversal number (Q790130) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- Infinite generalized friendship graphs (Q793756) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Sparse Ramsey graphs (Q795843) (← links)
- Combinatorial partitions of finite posets and lattices - Ramsey lattices (Q798338) (← links)
- Covering properties on \(X^ 2\setminus \Delta \), \(W\)-sets, and compact subsets of \(\Sigma\)-products (Q798974) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- On generalized Kneser hypergraph colorings (Q857422) (← links)
- Note on the game colouring number of powers of graphs (Q907829) (← links)
- A hypergraph-free construction of highly chromatic graphs without short cycles (Q915736) (← links)
- On Ramsey families of sets (Q917575) (← links)
- Infinite friendship graphs with infinite parameters (Q918996) (← links)
- Obligatory subsystems of triple systems (Q949814) (← links)
- An uncountably chromatic triple system (Q1046824) (← links)
- Cycles in graphs of uncountable chromatic number (Q1056761) (← links)
- On the use of senders in generalized Ramsey theory for graphs (Q1057876) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- On graphs that can be oriented as diagrams of ordered sets (Q1061751) (← links)
- On graphs with Ramsey-infinite blocks (Q1066916) (← links)
- Coloring graphs with locally few colors (Q1074595) (← links)
- Ramsey properties for classes of relational systems (Q1076045) (← links)
- Heawood inequalities (Q1092918) (← links)
- Some Ramsey-Turán type results for hypergraphs (Q1111567) (← links)
- Consistency results on infinite graphs (Q1117946) (← links)
