Abstract
We investigate the relationship between some theorems in finite combinatorics and their infinite counterparts: given a “finite” result how one can get an “infinite” version of it? We will also analyze the relationship between the proofs of a “finite” theorem and the proof of its “infinite” version.
The preparation of this paper was supported by the Hungarian National Foundation for Scientific Research grant no. 61600 and 68262
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Aharoni and E. Berger, Menger’s Theorem for Infinite Graphs, J. Graph Theory, 50 (2005), 199–211.
R. Aharoni, E. C. Milner and K. Prikry, Unfriendly partitions of a graph, J. Corn-bin. Theory, Ser. B, 50 (1990), no. 1, 1–10.
R. Ahlswede, P. L. Erdős and N. Graham, A splitting property of maximal antichains, Combinatorica, 15 (1995), no. 4, 475–480.
B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, 184, Springer-Verlag (New York, 1998).
V. Chvátal and L. Lovász, Every directed graph has a semi-kernel, Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 175. Lecture Notes in Math., Vol. 411, Springer (Berlin, 1974).
E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour and M. Yannakakis, The Complexity of Multiway Cuts, Proc. 24th Annual ACM Symp. on Theory of Computing (1992), pp. 241–251.
R. Diestel, Graph theory, Third edition. Graduate Texts in Mathematics, 173. Springer-Verlag (Berlin, 2005).
R. Diestel, Directions in Infinite Graph Theory and Combinatorics, Topics in Discrete Mathematics 3, Elsevier — North Holland, 1992.
P. Erdős, T. Grünwald and E. Vázsonyi, Végtelen gráfok Euler vonalairól (On Euler lines of infinite graphs, in Hungarian), Mat. Fiz. Lapok, 43 (1936).
P. Erdős, T. Grünwald and E. Vázsonyi, Über Euler-Linien unendlicher Graphen, J. Math. Phys., Mass. Inst. Techn., 17 (1938), 59–75.
P. L. Erdős, A. Frank and L. A. Székely, Minimum multiway cuts in trees, Discrete Appl. Math., 87 (1998), no. 1–3, 67–75.
P. L. Erdős and L. Soukup, How to split antichains in infinite posets, Combinatorica, 27 (2007), no. 2, 147–161.
P. L. Erdős and L. Soukup, Quasi-kernels and quasi-sinks in infinite graphs, submitted.
P. L. Erdős and L. A. Székely, Evolutionary trees: an integer multicommodity max-flow-min-cut theorem, Adv. in Appl. Math., 13 (1992), no. 4, 375–389.
A. Hajnal, Infinite combinatorics, Handbook of combinatorics, Vol. 1,2, 2085–2116, Elsevier (Amsterdam, 1995).
A. Hajnal, The chromatic number of the product of two N1-chromatic graphs can be countable, Combinatorica, 5 (1985), no. 2, 137–139.
P. Komjáth and V. Totik, Problems and theorems in classical set theory, Problem Books in Mathematics, Springer (New York, 2006).
S. Shelah and E. C. Milner, Graphs with no unfriendly partitions, A tribute to Paul Erdős, Cambridge Univ. Press (Cambridge, 1990), pp. 373–384.
L. Soukup, On chromatic number of product of graphs, Comment. Math. Univ. Carolin., 29 (1988), no. 1, 1–12.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Soukup, L. (2008). Infinite Combinatorics: From Finite to Infinite. In: Győri, E., Katona, G.O.H., Lovász, L., Sági, G. (eds) Horizons of Combinatorics. Bolyai Society Mathematical Studies, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77200-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77200-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77199-9
Online ISBN: 978-3-540-77200-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)