Da Qi Chen, Bipartite Saturation
Zoom ID: 869 4632 6610 (ibsdimag)In extremal graph theory, a graph G is H-saturated if G does not contain a copy of H but adding any missing edge to G creates a copy of H. …
Loading view.
Joonkyung Lee (이준경), On Ramsey multiplicity
Zoom ID:8628398170 (123450)Ramsey's theorem states that, for a fixed graph $H$, every 2-edge-colouring of $K_n$ contains a monochromatic copy of $H$ whenever $n$ is large enough. Perhaps one of the most natural …
Debsoumya Chakraborti, Rainbow matchings in edge-colored simple graphs
Room B232 IBS (기초과학연구원)There has been much research on finding a large rainbow matching in a properly edge-colored graph, where a proper edge coloring is a coloring of the edge set such that …
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 …
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 …