Zixiang Xu (徐子翔), Multilinear polynomial methods and stability results on set systems
Room B332 IBS (기초과학연구원)In 1966, Kleitman established that if
10 events found.
Discrete Math Seminar
Huy Tuan Pham, Random Cayley graphs and Additive combinatorics without groups
Room B332 IBS (기초과학연구원)A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman's celebrated theorem first provided a structural characterization of sets with small doubling over the integers, and subsequently Ruzsa in 1999 proved an analog for abelian groups with …
Tony Huynh, The Peaceable Queens Problem
Room B332 IBS (기초과학연구원)The peaceable queens problem asks to determine the maximum number
Laure Morelle, Bounded size modifications in time
Room B332
IBS (기초과학연구원)
A replacement action is a function
Jang Soo Kim (김장수), Longest elements in a semigroup of functions and Slater indices
Room B332 IBS (기초과학연구원)The group
Jungho Ahn (안정호), A coarse Erdős-Pósa theorem for constrained cycles
Room B332 IBS (기초과학연구원)An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem shows that for every positive integer
O-joung Kwon (권오정), Erdős-Pósa property of A-paths in unoriented group-labelled graphs
Room B332 IBS (기초과학연구원)A family
Sepehr Hajebi, The pathwidth theorem for induced subgraphs
Room B332 IBS (기초과학연구원)We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H, every graph of sufficiently large pathwidth contains either a large complete subgraph, a large complete bipartite induced minor, or an induced minor isomorphic to H. The …
Irene Muzi, An elementary bound for Younger’s conjecture
Room B332 IBS (기초과학연구원)In 1996, Reed, Robertson, Seymour and Thomas proved Younger's Conjecture, which states that for all directed graphs D, there exists a function f such that if D does not contain k disjoint cycles, D contains a feedback vertex set, i.e. a subset of vertices whose deletion renders the graph acyclic, of size bounded by f(k). …
Johannes Carmesin, Open problems in graph theory
Room B332 IBS (기초과학연구원)Since the proof of the graph minor structure theorem by Robertson and Seymour in 2004, its underlying ideas have found applications in a much broader range of settings than their original context. They have driven profound progress in areas such as vertex minors, pivot minors, matroids, directed graphs, and 2-dimensional simplicial complexes. In this talk, …