On chromatic number of finite set-systems
From MaRDI portal
Publication:5540284
DOI10.1007/BF01894680zbMath0157.55203OpenAlexW2065796538MaRDI QIDQ5540284
Publication date: 1968
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01894680
Related Items
Independent sets in k-chromatic graphs, Coloring, sparseness and girth, Generalized signed graphs of large girth and large chromatic number, Compactness and finite equivalence of infinite digraphs, Motivations and history of some of my conjectures, Scheduling independent tasks with multiple modes, A class of edge critical 4-chromatic graphs, Some theorems concerning the star chromatic number of a graph, A generalization of Kónig's theorem, Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization, The partite construction and Ramsey set systems, A category-theoretical approach to hypergraphs, High girth and extendability, Dualities and dual pairs in Heyting algebras, The complexity of generalized graph colorings, Partitions of graphs into cographs, The number of dependent arcs in an acyclic orientation, Constructing uniquely realizable graphs, The fractional chromatic number of Zykov products of graphs, The enumeration problem for color critical linear hypergraphs, Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, Critical hypergraphs for the weak chromatic number, New results on \(k\)-independence of hypergraphs, 2-chromatic Steiner quadruple systems, Graphs of large chromatic number, On balanced incomplete block designs with specified weak chromatic number, Constraints, MMSNP and expander relational structures, Critical graphs without triangles: an optimum density construction, Coloring graphs without short cycles and long induced paths, Generalized hypergraph coloring, From logical gates synthesis to chromatic bicritical clutters, Randomly colouring graphs (a combinatorial view), Unnamed Item, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Graph properties and hypergraph colourings, A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth, Mycielski type constructions for hypergraphs associated with fractional colorings, Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions, On a construction of graphs with high chromatic capacity and large girth, Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms, The existence problem for colour critical linear hypergraphs, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, The structure of critical Ramsey graphs, Graph theory, On colorings of graphs without short cycles, Conditional chromatic numbers with forbidden cycles, A short proof of the existence of highly chromatic hypergraphs without short cycles, The structure of critical Ramsey graphs, INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS, Vertex colorings of graphs without short odd cycles, The subchromatic number of a graph, Unnamed Item, On critical uniquely colorable graphs, On subgraphs of C2k-free graphs and a problem of Kühn and Osthus, A coloring problem, An interpolation theorem for partitions which are complete with respect to hereditary properties, Colour-critical graphs and hypergraphs, A Simple Construction to Prove Mycielski’s Theorem, Counterexamples to Borsuk's conjecture with large girth, What must and what need not be contained in a graph of uncountable chromatic number?, Cuts and bounds, Sparse Ramsey graphs, On the use of senders in generalized Ramsey theory for graphs, Combinatorial partitions of finite posets and lattices - Ramsey lattices, High girth hypergraphs with unavoidable monochromatic or rainbow edges
Cites Work
