David Munhá Correia, Rainbow matchings
I will discuss various results for rainbow matching problems. In particular, I will introduce a ‘sampling trick’ which can be used to obtain short proofs of old results as well …
10 events found.
Seminars and Colloquiums
Events
-
-
Zoom ID: 869 4632 6610 (ibsdimag)
-
Tuan Tran, Exponential decay of intersection volume with applications on list-decodability and sphere-covering bounds
Room B232 IBS (기초과학연구원)We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, …
-
-
Seunghun Lee (이승훈), Transversals and colorings of simplicial spheres
Room B232 IBS (기초과학연구원)Motivated from the surrounding property of a point set in $\mathbb{R}^d$ introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As …
-
Andreas Holmsen, Some recent results on geometric transversals
Room B232 IBS (기초과학연구원)A geometric transversal to a family of convex sets in $\mathbb R^d$ is an affine flat that intersects the members of the family. While there exists a far-reaching theory concerning …
-
Ron Aharoni, A strong version of the Caccetta-Haggkvist conjecture
Zoom ID: 869 4632 6610 (ibsdimag)The Caccetta-Haggkvist conjecture, one of the best known in graph theory, is that in a digraph with $n$ vertices in which all outdegrees are at least $n/k$ there is a …
-
Jaehyeon Seo (서재현), A rainbow Turán problem for color-critical graphs
Room B232 IBS (기초과학연구원)For given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a 'colorful' copy of $H$, i.e. a copy of $H$ containing …
-
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 $H$ as a minor. …
-
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 $u$ and $v$, each edge incident to exactly …
-
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 …