Joonkyung Lee (이준경), On common graphs
Zoom ID:8628398170 (123450)A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is minimised by the random colouring. Burr and Rosta, extending …
Loading view.
Deniz Sarikaya, What means Hamiltonicity for infinite graphs and how to force it via forbidden induced subgraphs
Zoom ID: 869 4632 6610 (ibsdimag)The study of Hamiltonian graphs, i.e. finite graphs having a cycle that contains all vertices of the graph, is a central theme of finite graph theory. For infinite graphs such …
Hong Liu (刘鸿), A solution to Erdős and Hajnal’s odd cycle problem
Room B232 IBS (기초과학연구원)I will go over the history on the study of the set of cycle lengths of graphs with large average degree or chromatic number, and discuss recent work with Richard …
Karl Heuer, Even Circuits in Oriented Matroids
Zoom ID: 869 4632 6610 (ibsdimag)In this talk I will state a generalisation of the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of …
Jaiung Jun (전재웅), On the Hopf algebra of multi-complexes
Zoom ID: 869 4632 6610 (ibsdimag)In combinatorics, Hopf algebras appear naturally when studying various classes of combinatorial objects, such as graphs, matroids, posets or symmetric functions. Given such a class of combinatorial objects, basic information …
Jinha Kim (김진하), On a conjecture by Kalai and Meshulam – the Betti number of the independence complex of ternary graphs
Room B232 IBS (기초과학연구원)Given a graph G=(V,E), the independence complex of G is the abstract simplicial complex I(G) on V whose faces are the independent sets of G. A graph is ternary if it does …
Paul Seymour, The Erdős-Hajnal conjecture is true for excluding a five-cycle
Zoom ID: 869 4632 6610 (ibsdimag)In an n-vertex graph, there must be a clique or stable set of size at least $C\log n$, and there are graphs where this bound is attained. But if we look at …
O-joung Kwon (권오정), Directed tangles and applications
Room B232 IBS (기초과학연구원)The canonical tree-decomposition theorem, proved by Robertson and Seymour in their seminal graph minors series, turns out to be an extremely valuable tool in structural and algorithmic graph theory. In …
Andreas Holmsen, Discrete geometry in convexity spaces
Room B232 IBS (기초과학연구원)The notion of convexity spaces provides a purely combinatorial framework for certain problems in discrete geometry. In the last ten years, we have seen some progress on several open problems …
Rose McCarty, Vertex-minors and flooding immersions
Zoom ID: 869 4632 6610 (ibsdimag)An immersion of a graph H into a graph G sends edges of H into edge-disjoint trails of G. We say the immersion is flooding if every edge of G …