Search

Your search keyword '"Georgakopoulos, Agelos"' showing total 4 results
Start Over Author "Georgakopoulos, Agelos" Topic combinatorics
4 results on '"Georgakopoulos, Agelos"'

1. Perfect matchings in -partite -graphs

Author

Aharoni, Ron, Georgakopoulos, Agelos, and Sprüssel, Philipp

Subjects
*MATCHING theory, *GRAPH theory, *COMBINATORICS, *MATHEMATICAL analysis, *NUMERICAL analysis, *GRAPHIC methods
Abstract

Abstract: Let be an -partite -graph, all of whose sides have the same size . Suppose that there exist two sides of , each satisfying the following condition: the degree of each legal -tuple contained in the complement of this side is strictly larger than . We prove that under this condition must have a perfect matching. This answers a question of Kühn and Osthus. [Copyright &y& Elsevier]

Published
2009
Full Text
View/download PDF

2. A short proof of Fleischner’s theorem

Author

Georgakopoulos, Agelos

Subjects
*GRAPH connectivity, *HAMILTONIAN graph theory, *PATHS & cycles in graph theory, *COMBINATORICS, *MATHEMATICAL analysis
Abstract

Abstract: We give a short proof of the fact that the square of a 2-connected finite graph is Hamiltonian. [Copyright &y& Elsevier]

Published
2009
Full Text
View/download PDF

3. Every rayless graph has an unfriendly partition.

Author

Bruhn, Henning, Diestel, Reinhard, Georgakopoulos, Agelos, and Sprüssel, Philipp

Subjects
GRAPH theory, PATHS & cycles in graph theory, PARTITIONS (Mathematics), COMBINATORICS, MATHEMATICAL analysis
Abstract

Abstract: It is proved that every graph containing no infinite path has an unfriendly partition. [Copyright &y& Elsevier]

Published
2009
Full Text
View/download PDF

4. Recent developments in graph Ramsey theory

Author

Jacob Fox, David Conlon, Benny Sudakov, Czumaj, Artur, Georgakopoulos, Agelos, Král, Daniel, Lozin, Vadim, and Pikhurko, Oleg

Subjects
Combinatorics, Extremal combinatorics, 010201 computation theory & mathematics, 010102 general mathematics, Ramsey theory, Graph (abstract data type), Natural number, 0102 computer and information sciences, Ramsey's theorem, 0101 mathematics, 01 natural sciences, Mathematics
Abstract

Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of K_N contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress.

Published
2015

Catalog

Books, media, physical & digital resources
See catalog results