Meike Hatzel, Constant congestion bramble
Zoom ID: 869 4632 6610 (ibsdimag)In this talk I will present a small result we achieved during a workshop in February this year. My coauthors on this are Marcin Pilipczuk, Paweł Komosa and Manuel Sorge. A …
10 events found.
Seminars and Colloquiums
-
-
-
Yijia Chen (陈翌佳), Graphs of bounded shrub-depth, through a logic lens
Zoom ID: 869 4632 6610 (ibsdimag)Shrub-depth is a graph invariant often considered as an extension of tree-depth to dense graphs. In this talk I will explain our recent proofs of two results about graphs of …
-
Duksang Lee (이덕상), Characterizing matroids whose bases form graphic delta-matroids
Room B232 IBS (기초과학연구원)We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass …
-
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. …
-
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 …