Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
An $r$-graph is an $r$-regular graph in which every odd set of vertices is connected to its complement by at least $r$ edges. A central question regarding $r$-graphs is determining …
10 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
Jun Gao (高峻), Phase transition of degenerate Turán problems in p-norms
Room B332 IBS (기초과학연구원)For a positive real number $p$, the $p$-norm $\|G\|_p$ of a graph $G$ is the sum of the $p$-th powers of all vertex degrees. We study the maximum $p$-norm $\mathrm{ex}_{p}(n,F)$ …
-
Joonkyung Lee (이준경), Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials
Room B332 IBS (기초과학연구원)An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms …
-
Zixiang Xu (徐子翔), Multilinear polynomial methods and stability results on set systems
Room B332 IBS (기초과학연구원)In 1966, Kleitman established that if \( |A \triangle B| \leq d \) for any \( A, B \in \mathcal{F} \), then \( |\mathcal{F}| \leq \sum_{i=0}^{k} \binom{n}{i} \) for \( …
-
-
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 …
-
Tony Huynh, The Peaceable Queens Problem
Room B332 IBS (기초과학연구원)The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ …
-
Laure Morelle, Bounded size modifications in time $2^{{\sf poly}(k)}\cdot n^2$
Room B332 IBS (기초과학연구원)A replacement action is a function $\mathcal L$ that maps each graph to a collection of subgraphs of smaller size. Given a graph class $\mathcal H$, we consider a general …
-
-
Jang Soo Kim (김장수), Longest elements in a semigroup of functions and Slater indices
Room B332 IBS (기초과학연구원)The group \( S_n \) of permutations on \(=\{1,2,\dots,n\} \) is generated by simple transpositions \( s_i = (i,i+1) \). The length \( \ell(\pi) \) of a permutation \( \pi …
-
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 …
-
O-joung Kwon (권오정), Erdős-Pósa property of A-paths in unoriented group-labelled graphs
Room B332 IBS (기초과학연구원)A family $\mathcal{F}$ of graphs is said to satisfy the Erdős-Pósa property if there exists a function $f$ such that for every positive integer $k$, every graph $G$ contains either …