An infinite version of Ryser's inequality

DOI10.1016/0097-3165(86)90071-3zbMath0612.05005OpenAlexW2010520169MaRDI QIDQ1087875

Péter Komjáth

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90071-3

zbMATH Keywords

axiom of choiceRyser's inequality

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Cites Work

• Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• König's Duality Theorem for Infinite Bipartite Graphs

This page was built for publication: An infinite version of Ryser's inequality