A generalization of Kónig's theorem

DOI10.1007/BF01894789zbMath0209.55202OpenAlexW2043427324MaRDI QIDQ5611639

No author found.

Publication date: 1970

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

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

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (17)

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas ⋮ On k-transversals ⋮ Generalized polymatroids and submodular flows ⋮ An application of submodular flows ⋮ Edge-partitioning 3-edge-connected graphs into paths ⋮ Extremal problems in hypergraph colourings ⋮ On decomposing a hypergraph into \(k\) connected sub-hypergraphs ⋮ A Survey on Covering Supermodular Functions ⋮ Packing branchings under cardinality constraints on their root sets ⋮ On the number of edges in hypergraphs critical with respect to strong colourings ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ Spanning tree with lower bound on the degrees ⋮ List Coloring of Two Matroids through Reduction to Partition Matroids ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Packing trees with constraints on the leaf degree ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings ⋮ Sparse hypergraphs and pebble game algorithms

Cites Work

• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Unnamed Item

This page was built for publication: A generalization of Kónig's theorem