Couplages et transversaux généralises d'un hypergraphe infini

DOI10.1016/0095-8956(82)90006-5MaRDI QIDQ1160144zbMATH OpenOpenAlexFDO

Authors Norbert Polat

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0095-8956(82)90006-5

zbMATH Keywords

matchingtransversal

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 3477226 (Why is no real title available?)
• scientific article; zbMATH DE number 3637930 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Charakterisierung der Graphen ohne unendliche Wege
• Decomposition of Graphs Into Closed and Endless Chains
• Matchings in infinite graphs
• Mengerian theorems for paths of bounded length

Cited in

(2)

• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger's theorem to infinite graphs)

This page was built for publication: Couplages et transversaux généralises d'un hypergraphe infini

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160144)