ON THE TWO-COLOURING OF HYPERGRAPHS

DOI10.1093/qmath/25.1.303zbMath0299.05122OpenAlexW2025484786MaRDI QIDQ4053703

P. D. Seymour

Publication date: 1974

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/25.1.303

Mathematics Subject Classification ID

Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (37)

Even cycles in directed graphs ⋮ Characterization of even directed graphs ⋮ Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas ⋮ Majority colourings of digraphs ⋮ Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Hypergraph colouring and the Lovász local lemma ⋮ Blocking set free configurations and their relations to digraphs and hypergraphs ⋮ On the frequency of the most frequently occurring variable in dual monotone DNFs ⋮ Some properties of non-bicolorable hypergraphs and the four-color problem ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Color-critical graphs and hypergraphs with few edges and no short cycles ⋮ Majority choosability of digraphs ⋮ On 2-Colorings of Hypergraphs ⋮ Equilibria of graphical games with symmetries ⋮ Extremal problems in hypergraph colourings ⋮ Out-degree reducing partitions of digraphs ⋮ Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs ⋮ Antisymmetric flows and edge-connectivity ⋮ Dominating and total dominating partitions in cubic graphs ⋮ On the number of edges in hypergraphs critical with respect to strong colourings ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ Total domination of graphs and small transversals of hypergraphs ⋮ A short proof of Fisher's inequality ⋮ The Even Cycle Problem for Directed Graphs ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs ⋮ Monotone bargaining is Nash-solvable ⋮ A quantitative Lovász criterion for Property B ⋮ Square critically 3-chromatic hypergraphs ⋮ Strong orientations without even directed circuits ⋮ Signsolvability revisited ⋮ 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 ⋮ On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph ⋮ Sparse colour-critical hypergraphs ⋮ On 2-coloring certain \(k\)-uniform hypergraphs ⋮ Sign-nonsingular matrices and even cycles in directed graphs

This page was built for publication: ON THE TWO-COLOURING OF HYPERGRAPHS