scientific article; zbMATH DE number 15459
[For the entire collection see Zbl 0699.00016.] The authors provide a survey of two infinite extremal problems. The first of these concerns versions of Menger's theorem for infinite orders. Here for example it is known that if an ordered set contains at most \(k\) pairwise disjoint maximal chains, where \(k\) is finite, then for any finite family of maximal chains there is a set which intersects each of these chains. (This result is due jointly to R. Aharoni and the authors.) The second problem involves the extension of the Gallai-Milgram theorem to infinite graphs. It is known, thanks to the authors, that if \(G\) is a graph with no infinite independent set and each finite set of vertices is contained in the union of \(k\) pairwise disjoint paths, where \(k\) is finite, then \(G\) is covered by \(k\) pairwise disjoint paths. (In this context a path is defined to be a directed graph whose transitive closure is a linear ordering.).
- scientific article; zbMATH DE number 3185006
- An extremal problem for sets with applications to graph theory
- scientific article; zbMATH DE number 4095512
- Cut-sets in infinite graphs and partial orders
- On finite fixed sets in infinite graphs
- Gallai-Milgram properties for infinite graphs
- scientific article; zbMATH DE number 3924817
- scientific article; zbMATH DE number 3540832
- A Mengerian theorem for infinite graphs with ideal points
- Extremal infinite graph theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972097)
