Ben Lund, Radial projections in finite space
Room B332 IBS (기초과학연구원)Given a set $E$ and a point $y$ in a vector space over a finite field, the radial projection $\pi_y(E)$ of $E$ from $y$ is the set of lines that …
Loading view.
Xizhi Liu, Hypergraph Turán problem: from 1 to ∞
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]One interesting difference between (nondegenerate) Graph Turán problem and Hypergraph Turán problem is that the hypergraph families can have at least two very different extremal constructions. In this talk, we …
Eric Vigoda, Computational phase transition and MCMC algorithms
Room B332 IBS (기초과학연구원)This talk will highlight recent results establishing a beautiful computational phase transition for approximate counting/sampling in (binary) undirected graphical models (such as the Ising model or on weighted independent sets). The computational problem is to …
Sepehr Hajebi, Holes, hubs and bounded treewidth
Zoom ID: 869 4632 6610 (ibsdimag)A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a …
Kevin Hendrey, Product Structure of Graph Classes with Bounded Treewidth
Room B232 IBS (기초과학연구원)The strong product $G\boxtimes H$ of graphs $G$ and $H$ is the graph on the cartesian product $V(G)\times V(H)$ such that vertices $(v,w)$ and $(x,y)$ are adjacent if and only …
Jinyoung Park (박진영), Thresholds 1/2
Room B332 IBS (기초과학연구원)Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on …
Jinyoung Park (박진영), Thresholds 2/2
Room B332 IBS (기초과학연구원)Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on …
Noam Lifshitz, Product free sets in the alternating group
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]A subset of a group is said to be product free if it does not contain the product of two elements in it. We consider how large can a product …
Seunghun Lee (이승훈), Inscribable order types
Room B332 IBS (기초과학연구원)We call an order type inscribable if it is realized by a point configuration where all extreme points are all on a circle. In this talk, we investigate inscribability of …
Lars Jaffke, Taming graphs with no large creatures and skinny ladders
Zoom ID: 869 4632 6610 (ibsdimag)We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class $\mathcal{G}$ there exists a constant $k$ such that no member of $\mathcal{G}$ contains a $k$-creature …