Pages that link to "Item:Q5540284"

The following pages link to On chromatic number of finite set-systems (Q5540284):

Displaying 50 items.

• Coloring, sparseness and girth (Q312271) (← links)
• Constructing uniquely realizable graphs (Q393739) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
• A category-theoretical approach to hypergraphs (Q599833) (← links)
• Dualities and dual pairs in Heyting algebras (Q603889) (← links)
• Partitions of graphs into cographs (Q607000) (← links)
• The fractional chromatic number of Zykov products of graphs (Q617003) (← 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)
• 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)
• On the use of senders in generalized Ramsey theory for graphs (Q1057876) (← links)
• Independent sets in k-chromatic graphs (Q1076033) (← links)
• The partite construction and Ramsey set systems (Q1119640) (← links)
• The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
• Critical hypergraphs for the weak chromatic number (Q1148325) (← links)
• 2-chromatic Steiner quadruple systems (Q1151134) (← links)
• Graph properties and hypergraph colourings (Q1184854) (← links)
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732) (← links)
• On colorings of graphs without short cycles (Q1257905) (← links)
• A short proof of the existence of highly chromatic hypergraphs without short cycles (Q1260043) (← links)
• Compactness and finite equivalence of infinite digraphs (Q1356449) (← links)
• Motivations and history of some of my conjectures (Q1356729) (← links)
• A class of edge critical 4-chromatic graphs (Q1359372) (← links)
• Some theorems concerning the star chromatic number of a graph (Q1362095) (← links)
• The number of dependent arcs in an acyclic orientation (Q1386477) (← links)
• Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
• The subchromatic number of a graph (Q1823255) (← links)
• Scheduling independent tasks with multiple modes (Q1900136) (← links)
• High girth and extendability (Q1918540) (← links)
• The complexity of generalized graph colorings (Q1923585) (← links)
• From logical gates synthesis to chromatic bicritical clutters (Q1961457) (← links)
• High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
• Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
• Generalized hypergraph coloring (Q2214310) (← links)
• Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (Q2264683) (← links)
• Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
• On balanced incomplete block designs with specified weak chromatic number (Q2434889) (← links)
• Constraints, MMSNP and expander relational structures (Q2439829) (← links)
• Critical graphs without triangles: an optimum density construction (Q2439835) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• On critical uniquely colorable graphs (Q2552509) (← links)
• A coloring problem (Q2561233) (← links)
• An interpolation theorem for partitions which are complete with respect to hereditary properties (Q2562787) (← links)
• Colour-critical graphs and hypergraphs (Q2563172) (← links)
• Cuts and bounds (Q2575795) (← links)