On chromatic number of graphs and set-systems

DOI10.1007/BF02020444zbMath0151.33701OpenAlexW4250699352WikidataQ57259020 ScholiaQ57259020MaRDI QIDQ5530478

Publication date: 1966

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02020444

zbMATH Keywords

topology

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Ramsey properties for classes of relational systems, Linear spaces with many small lines, Triplication for BSTSs and uncolourability, Cardinal invariants of closed graphs, Heawood inequalities, Problems and results in discrete mathematics, The use of elementary substructures in combinatorics, Subgraph transversal of graphs, Coloring, sparseness and girth, Chromatic numbers of graphs -- large gaps, Compactness and finite equivalence of infinite digraphs, A class of edge critical 4-chromatic graphs, Star chromatic numbers of hypergraphs and partial Steiner triple systems, On generalized Kneser hypergraph colorings, Two remarks on the coloring number, Axiomatisability and hardness for universal Horn classes of hypergraphs, A new exact maximum clique algorithm for large and massive sparse graphs, Ramsey families which exclude a graph, Some Ramsey-Turán type results for hypergraphs, On Taylor's problem, Consistency results on infinite graphs, Complete arcs in Steiner triple systems, Applications of hypergraph coloring to coloring graphs not inducing certain trees, The partite construction and Ramsey set systems, Connectivity and chromatic number of infinite graphs, Chromatically optimal rigid graphs, Color-critical graphs and hypergraphs with few edges and no short cycles, Dualities and dual pairs in Heyting algebras, The list-chromatic number of infinite graphs, A note on chromatic number and connectivity of infinite graphs, The complexity of generalized graph colorings, Cycle lengths and minimum degree of graphs, Hadwiger's conjecture for uncountable graphs, Statistics of orderings, Chromatic numbers and Bohr topologies, Erdős-Hajnal well-orderings and n-degenerate graphs, The enumeration problem for color critical linear hypergraphs, The list-chromatic number of infinite graphs defined on Euclidean spaces, Note on the game colouring number of powers of graphs, Families of sets having property B, Coloring the hypergraph of maximal cliques of a graph with no long path, Amalgamation of matroids and its applications, A hypergraph-free construction of highly chromatic graphs without short cycles, Shift graphs on precompact families of finite sets of natural numbers, On Ramsey families of sets, On the combinatorial problems which I would most like to see solved, Infinite friendship graphs with infinite parameters, Uncolorable mixed hypergraphs, What is Ramsey-equivalent to a clique?, Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings, A search problem on graphs which generalizes some group testing problems with two defectives, Distributed approximation of \(k\)-service assignment, Orientations of graphs with prescribed weighted out-degrees, Trees, ladders and graphs, Coloring digraphs with forbidden cycles, Graph properties and hypergraph colourings, Coloring the normalized Laplacian for oriented hypergraphs, Obligatory subsystems of triple systems, Hedetniemi's conjecture for uncountable graphs, Infinitely connected subgraphs in graphs of uncountable chromatic number, A parallel maximum clique algorithm for large and massive sparse graphs, Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs, On chromatic numbers of two extensions of planar graphs, In search of the densest subgraph, Zero-free intervals of chromatic polynomials of hypergraphs, Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs, On a construction of graphs with high chromatic capacity and large girth, Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms, Ramsey-type results for metric spaces, Ramsey varieties, Partitions of finite relational and set systems, Le nombre minimal de colorations d'un hypergraphe k-chromatique, A note on hypergraphs with the Helly-property, Representing graphs in Steiner triple systems, A short proof of the existence of highly chromatic hypergraphs without short cycles, Ramsey-type theorems, Kneser's conjecture, chromatic number, and homotopy, Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\), On sets of integers with the Schur property, The subchromatic number of a graph, Sum coloring and interval graphs: A tight upper bound for the minimum number of colors, The dichromatic number of a digraph, On Ramsey - Turan type theorems for hypergraphs, An uncountably chromatic triple system, Hypergraph families with bounded edge cover or transversal number, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Infinite generalized friendship graphs, What must and what need not be contained in a graph of uncountable chromatic number?, Coloring face-hypergraphs of graphs on surfaces, Cycles in graphs of uncountable chromatic number, Sparse Ramsey graphs, On the use of senders in generalized Ramsey theory for graphs, Chromatic number of finite and infinite graphs and hypergraphs, Combinatorial partitions of finite posets and lattices - Ramsey lattices, Covering properties on \(X^ 2\setminus \Delta \), \(W\)-sets, and compact subsets of \(\Sigma\)-products, On graphs that can be oriented as diagrams of ordered sets, On graphs with Ramsey-infinite blocks, Sparse colour-critical hypergraphs, Unbalanced Steiner triple systems, Coloring graphs with locally few colors, Disjointness graphs of short polygonal chains, Ramsey Equivalence for Asymmetric Pairs of Graphs, A solution to Erdős and Hajnal’s odd cycle problem, Coloring the distance graphs, Coloring Block Designs is NP-Complete, Cycles in color-critical graphs, On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles, On indicated chromatic number of graphs, Infinite stable graphs with large chromatic number, A Coloring Result for the Plane, Coloring Steiner Triple Systems, On decomposition of graphs, On the Ramsey Property of Families of Graphs, Parallel Maximum Clique Algorithms with Applications to Network Analysis, Applications of a Set-Theoretic Lemma, Radius two trees specify χ‐bounded classes, A note on the Engelking-Karłowicz theorem, THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH, A generalization of Kónig's theorem, Unnamed Item, On a vertex-edge marking game on graphs, The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices, In memoriam: James Earl Baumgartner (1943--2011), Radius two trees specify χ‐bounded classes, Bispindle in strongly connected digraphs with large chromatic number, Unnamed Item, On the growth rate of chromatic numbers of finite subgraphs, Turán-Ramsey Theorems and K_p-Independence Numbers, Extremal decompositions for Nordhaus-Gaddum theorems, Flexible list colorings in graphs with special degeneracy conditions, Weak degeneracy of graphs, Chromatic number is Ramsey distinguishing, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Central Limit Theorem for Linear Eigenvalue Statistics of <scp>Non‐Hermitian</scp> Random Matrices, On Finite Maximal Antichains in the Homomorphism Order, Subdivision of hypergraphs and their colorings, Cusp universality for random matrices. I: Local law and the complex Hermitian case, Unnamed Item, \(H\)-sequences and 2-step coreness in graphs, Congruence of cycle lengths and chromatic number, Concepts on coloring of cluster hypergraphs with application, Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, Extremal problems in hypergraph colourings, Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs, On balanced incomplete block designs with specified weak chromatic number, Access balancing in storage systems by labeling partial Steiner systems, A note on the connected game coloring number, Good point sequencings of Steiner triple systems, Unnamed Item, Generalized hypergraph coloring, Strong downward Löwenheim-Skolem theorems for stationary logics. I, Why Is Maximum Clique Often Easy in Practice?, Subdivisions of four blocks cycles in digraphs with large chromatic number, A Strengthening on Odd Cycles in Graphs of Given Chromatic Number, A polynomial algorithm for the max-cut problem on graphs without long odd cycles, Eigenstate thermalization hypothesis for Wigner matrices, Flexible List Colorings in Graphs with Special Degeneracy Conditions, Mycielski type constructions for hypergraphs associated with fractional colorings, On a combinatorial game, Note on the group edge irregularity strength of graphs, The existence problem for colour critical linear hypergraphs, The structure of critical Ramsey graphs, The chromatic number of infinite graphs - A survey, Cycle length parities and the chromatic number, Splitting Strongly Almost Disjoint Families, Semialgebraic graphs having countable list-chromatic numbers, Complete colourings of hypergraphs, Graph theory, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, INFINITE COMBINATORICS PLAIN AND SIMPLE, On the growth rate of dichromatic numbers of finite subdigraphs, Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions, From \(A\) to \(B\) to \(Z\), Subexponential parameterized algorithms and kernelization on almost chordal graphs, Problems on chromatic polynomials of hypergraphs, Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs, The structure of critical Ramsey graphs, Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl, Combinatorial Dichotomies in Set Theory, A Two-Cardinal Theorem, Equitable colorings of hypergraphs with few edges, Lower bounds on coloring numbers from hardness hypotheses in pcf theory, Vertex colorings of graphs without short odd cycles, Separability properties of almost-disjoint families of sets, On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus, Embedding Graphs into Colored Graphs, Nonfinitely based ai-semirings with finitely based semigroup reducts, An interpolation theorem for partitions which are complete with respect to hereditary properties, Colour-critical graphs and hypergraphs, GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES, Burling graphs, chromatic number, and orthogonal tree-decompositions, On the chromatic number of Steiner triple systems of order 25, DP-degree colorable hypergraphs, Cuts and bounds, Unnamed Item, Balanced matrices, A note on uncountable chordal graphs, An enhanced bitstring encoding for exact maximum clique search in sparse graphs, Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra, Zur Geometrie der Kreislagerungen, On chromatic number of finite set-systems, A Relaxed Version of the Erdős–Lovász Tihany Conjecture, High girth hypergraphs with unavoidable monochromatic or rainbow edges

Cites Work