Pages that link to "Item:Q5530478"

The following pages link to On chromatic number of graphs and set-systems (Q5530478):

Displayed 50 items.

• Ramsey-type results for metric spaces (Q579261) ‎ (← links)
• Ramsey varieties (Q585254) ‎ (← 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)
• On generalized Kneser hypergraph colorings (Q857422) ‎ (← 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)
• 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)
• 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)