Rose McCarty, Vertex-minors and flooding immersions
An immersion of a graph H into a graph G sends edges of H into edge-disjoint trails of G. We say the immersion is flooding if every edge of G …
10 events found.
Seminars and Colloquiums
Events
-
-
Zoom ID: 869 4632 6610 (ibsdimag)
-
Ben Lund, Perfect matchings and derangements on graphs
Room B232 IBS (기초과학연구원)We show that each perfect matching in a bipartite graph G intersects at least half of the perfect matchings in G. This result has equivalent formulations in terms of the permanent …
-
Yusuke Kobayashi (小林 佑輔), An FPT Algorithm for Minimum Additive Spanner Problem
Zoom ID: 869 4632 6610 (ibsdimag)For a positive integer t and a graph G, an additive t-spanner of G is a spanning subgraph in which the distance between every pair of vertices is at most …
-
Tuan Tran, Minimum saturated families of sets
Room B232 IBS (기초과학연구원)A family $\mathcal F$ of subsets of is called s-saturated if it contains no s pairwise disjoint sets, and moreover, no set can be added to $\mathcal F$ while preserving …
-
Dong Yeap Kang (강동엽), A proof of the Erdős-Faber-Lovász conjecture
Zoom ID: 869 4632 6610 (ibsdimag)A hypergraph is linear if every pair of two distinct edges shares at most one vertex. A longstanding conjecture by Erdős, Faber, and Lovász in 1972, states that the chromatic …
-
-
Ron Aharoni, Colorful KKM and multiple cakes division
Zoom ID: 869 4632 6610 (ibsdimag)In the "cake partition" problem n players have each a list of preferred parts for any partition of the interval ("cake") into n sub-intervals. Woodall, Stromquist and Gale proved independently that under mild …
-
Doowon Koh (고두원), On the cone restriction conjecture in four dimensions and applications in incidence geometry
Room B232 IBS (기초과학연구원)Main purpose of this talk is to introduce a connection between restriction estimates for cones and point-sphere incidence theorems in the finite field setting. First, we review the finite field …
-
Jie Ma (马杰), Non-repeated cycle lengths and Sidon sequences
Zoom ID: 869 4632 6610 (ibsdimag)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 …
-
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 …