Ben Lund, Incidences between points and n-flats in PG(n+d,q)
Let $P$ be a set of points in $PG(n+d,q)$, and let $L$ be a set of $n$-flats. Here, $n$-flat is a short name for $n$-dimensional projective subspaces. A classical bound …
6 events found.
Seminars and Colloquiums
Events
-
-
Room B332 IBS (기초과학연구원)
-
Olga Medrano Martín del Campo, Epsilon-saturation for Littlestone classes and stable graphs
Room B332 IBS (기초과학연구원)We introduce the concept of the saturation of a (bi)graph: the union closure after inductively adding its virtual elements, which are weighted ε-good (respectively ε-excellent sets) as in the Stable …
-
Gabriëlle Zwaneveld, On Seymour-tight orientations
Room B332 IBS (기초과학연구원)I discuss 'almost counterexamples' to Seymour's second neighbourhood conjecture. In what we call Seymour-tight orientations, the size of the first neighbourhood of each vertex equals the size of its second …
-
David Wood, Proof of the Clustered Hadwiger Conjecture
Room B332 IBS (기초과학연구원)Hadwiger famously conjectured that every $K_h$-minor-free graph is properly $(h-1)$-colourable. This talk will present the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with …
-
-
Daniel McGinnis, Multi-generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for $d$-Leray complexes
Room B332 IBS (기초과학연구원)A celebrated result of Bayer and Stillman from 1987 states that for a homogeneous ideal $I$ of a polynomial ring $S$, the regularities of $S/I$ and $S/\textrm{GIN}(I)$ are the same …
-
Julien Codsi, Recent progress in the tree-⍺ world
Room B332 IBS (기초과학연구원)Treewidth is a graph parameter commonly used to quantify how "close" a graph is to a tree. Although it is a cornerstone of structural graph theory and algorithm design, it …