Jie Ma (马杰), Non-repeated cycle lengths and Sidon sequences
We prove a conjecture of Boros, Caro, Furedi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of …
10 events found.
Seminars and Colloquiums
Events
-
-
Zoom ID: 869 4632 6610 (ibsdimag)
-
Martin Ziegler, Quantitative Coding and Complexity Theory of Continuous Data
Room B232 IBS (기초과학연구원)Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding …
-
David Wood, Tree densities of sparse graph classes
Zoom ID: 869 4632 6610 (ibsdimag)This talk considers the following question at the intersection of extremal and structural graph theory: What is the maximum number of copies of a fixed forest $T$ in an $n$-vertex graph in a …
-
Minki Kim (김민기), Rainbow paths and rainbow matchings
Room B232 IBS (기초과학연구원)We prove that if $n \geq 3$, then any family of $3n-3$ sets of matchings of size $n$ in any graph has a rainbow matching of size $n$. This improves …
-
-
Kevin Hendrey, A unified half-integral 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 …
-
Debsoumya Chakraborti, Some classical problems in graph saturation
Room B232 IBS (기초과학연구원)Graph saturation is one of the oldest areas of investigation in extremal combinatorics. A graph $G$ is called $F$-saturated if $G$ does not contain a subgraph isomorphic to $F$, but …
-
Se-Young Yun (윤세영), Regret in Online Recommendation Systems
Room B232 IBS (기초과학연구원)We propose a theoretical analysis of recommendation systems in an online setting, where items are sequentially recommended to users over time. In each round, a user, randomly picked from a …
-
Yixin Cao (操宜新), Recognizing (unit) interval graphs by zigzag graph searches
Room B232 IBS (기초과학연구원)Corneil, Olariu, and Stewart presented a recognition algorithm for interval graphs by six graph searches. Li and Wu simplified it to only four. The great simplicity of the latter algorithm …
-
Hong Liu (刘鸿), Nested cycles with no geometric crossing
Room B232 IBS (기초과학연구원)In 1975, Erdős asked the following question: what is the smallest function $f(n)$ for which all graphs with $n$ vertices and $f(n)$ edges contain two edge-disjoint cycles $C_1$ and $C_2$, …
-
Édouard Bonnet, Twin-width and ordered binary structures
Zoom ID: 869 4632 6610 (ibsdimag)The twin-width of a graph G can be defined as the least integer d such that there is a sequence of length |V(G)| of (strictly) coarser and coarser partitions of …