Infinite combinatorics: from finite to infinite

MaRDI QIDQ3509407zbMATH OpenFDO

Authors Lajos Soukup

Publication date 1 July 2008

zbMATH Keywords

antichainschromatic numberconnectednesscoveringEuler circlesEuler trailsgraph productsmatchingmultiway cut problemrelationship between theorems in finite combinatorics and infinite combinatoricsspanning treestournamentsunfriendly partition

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05Cxx)

Recommendations

• ÜBER Euler‐Linien Unendlicher Graphen
• Duality in Infinite Graphs
• On infinite cycles. I, II
• scientific article; zbMATH DE number 3185006
• A link between Menger's theorem and infinite Euler graphs

Cited in

(6)

• An infinite version of the Pólya enumeration theorem
• Infinite Combinatorics
• Hedetniemi's conjecture for uncountable graphs
• Axiom of choice, maximal independent sets, argumentation and dialogue games
• ÜBER Euler‐Linien Unendlicher Graphen
• Reversibility of extreme relational structures

This page was built for publication: Infinite combinatorics: from finite to infinite

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