Jaehyeon Seo (서재현), A rainbow Turán problem for color-critical graphs
Room B232 IBS (기초과학연구원)For given
10 events found.
Ken-ichi Kawarabayashi (河原林 健一), Toward Directed Graph Minor Theory
Zoom ID: 869 4632 6610 (ibsdimag)Graph Minor project by Robertson and Seymour is perhaps the deepest theory in Graph Theory. It gives a deep structural characterization of graphs without any graph
O-joung Kwon (권오정), Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Room B232 IBS (기초과학연구원)In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying
Bo Ning (宁博), Substructures and eigenvalues of graphs: Triangles and quadrilaterals
Zoom ID: 869 4632 6610 (ibsdimag)Our talk will mainly focus on the relationship between substructures and eigenvalues of graphs. We will briefly survey recent developments on a conjecture of Bollobás and Nikiforov and a classical …
Pascal Gollin, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
Room B232 IBS (기초과학연구원)Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all …
James Davies, Separating polynomial
Zoom ID: 869 4632 6610 (ibsdimag)
We prove that there is a function
Jinha Kim (김진하), Independent domination of graphs with bounded maximum degree
Room B232 IBS (기초과학연구원)An independent dominating set of a graph, also known as a maximal independent set, is a set
Manuel Lafond, Recognizing k-leaf powers in polynomial time, for constant k
Zoom ID: 869 4632 6610 (ibsdimag)A graph G is a k-leaf power if there exists a tree T whose leaf set is V(G), and such that uv is an edge if and only if the …
Donggyu Kim (김동규), A stronger version of Tutte’s wheel theorem for vertex-minors
Room B232 IBS (기초과학연구원)Tutte (1961) proved that every simple
Sang-il Oum (엄상일), Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
Room B232 IBS (기초과학연구원)Every minor-closed class of matroids of bounded branch-width can be characterized by a minimal list of excluded minors, but unlike graphs, this list could be infinite in general. However, for …