On a combinatorial problem. II
From MaRDI portal
Publication:5599180
DOI10.1007/BF01897152zbMath0201.33704OpenAlexW2130108851WikidataQ56444797 ScholiaQ56444797MaRDI QIDQ5599180
Publication date: 1964
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01897152
Related Items
Hypergraphs with high chromatic number, Probabilistic methods, From Erdős to algorithms, A note on random greedy coloring of uniform hypergraphs, On general two-colorings of uniform hypergraphs, Equitable colorings of nonuniform hypergraphs, Multipass greedy coloring of simple uniform hypergraphs, On the chromatic number and independence number of hypergraph products, Improper Choosability and Property B, Chain method for panchromatic colorings of hypergraphs, A note on two-colorability of nonuniform hypergraphs, Equitable colorings of hypergraphs with \(r\) colors, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, On proper colorings of hypergraphs, On 3-chromatic hypergraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, A note on panchromatic colorings, DP-colorings of hypergraphs, The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets, 2-colorings of hypergraphs with large girth, Extremal problems in hypergraph colourings, Combinatorial extremum problems for 2-colorings of hypergraphs, On colorings of 3-homogeneous hypergraphs in 3 colors, On property B(s). II, Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph, Colorings of hypergraphs with large number of colors, On two-colorings of hypergraphs, On \(r\)-chromatic hypergraphs, On the construction of non-2-colorable uniform hypergraphs, Random hypergraphs and property B, 2-colorings of uniform hypergraphs, On a generalization of Rubin's theorem, On the chromatic number of set systems, The Cayley isomorphism property for Cayley maps, Coloring cross-intersecting families, Inclusion/exclusion meets measure and conquer, Choosability with Separation of Complete Multipartite Graphs and Hypergraphs, On a combinatorial game, On balanced colorings of hypergraphs, On the ratio of optimal integral and fractional covers, Bipartite bihypergraphs: a survey and new results, On property B and on Steiner systems, Extremal problems among subsets of a set. (Reprint), An extremal problem in hypergraph coloring, Equipartite colorings in graphs and hypergraphs, On proper colourings of hypergraphs using prescribed colours, On the chromatic number of generalized Kneser graphs and Hadamard matrices, On a combinatorial problem of P. Erdős and L. Lovasz, ERDŐS AND SET THEORY, Chip games and paintability, Improvement of the lower bound in the Erdös-Hajnal combinatorial problem, On equitable colorings of hypergraphs, Coloring non-uniform hypergraphs without short cycles, List colorings of multipartite hypergraphs, Matchings and covers in hypergraphs, The Lovász Local Lemma and Satisfiability, The \(B_r\) property and chromatic numbers of generalized graphs, On the chromatic number of finite systems of subsets, Separability properties of almost-disjoint families of sets, Some remarks on simple tournaments, The choice number of random bipartite graphs, Random coloring method in the combinatorial problem of Erdős and Lovász, Extremal problems among subsets of a set, On the Problem of Erdős and Hajnal in the Case of List Colorings, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), Puncture sets, Sparse colour-critical hypergraphs
Cites Work
