Infinite Combinatorics: From Finite to Infinite
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.
KeywordsSpan Tree Finite Graph Infinite Graph Edge Disjoint Finite Combinatorics
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- R. Diestel, Directions in Infinite Graph Theory and Combinatorics, Topics in Discrete Mathematics 3, Elsevier — North Holland, 1992.Google Scholar
- 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).Google Scholar
- 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.Google Scholar
- P. L. Erdős and L. Soukup, Quasi-kernels and quasi-sinks in infinite graphs, submitted.Google Scholar
- A. Hajnal, Infinite combinatorics, Handbook of combinatorics, Vol. 1,2, 2085–2116, Elsevier (Amsterdam, 1995).Google Scholar
- 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.Google Scholar