### 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 …

Skip to content
##

###
Ben Lund, Radial projections in finite space

Room B332
IBS (기초과학연구원)
##

###
Eric Vigoda, Computational phase transition and MCMC algorithms

Room B332
IBS (기초과학연구원)
###
Kevin Hendrey, Product Structure of Graph Classes with Bounded Treewidth

Room B232
IBS (기초과학연구원)
###
Jinyoung Park (박진영), Thresholds 1/2

Room B332
IBS (기초과학연구원)
###
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 …

##

###
Seunghun Lee (이승훈), Inscribable order types

Room B332
IBS (기초과학연구원)
###
Eun Jung Kim (김은정), Directed flow-augmentation

Room B332
IBS (기초과학연구원)
###
Noleen Köhler, Testing first-order definable properties on bounded degree graphs

Room B332
IBS (기초과학연구원)
###
Raul Lopes, Temporal Menger and related problems

Room B332
IBS (기초과학연구원)
###
Jun Gao, Number of (k-1)-cliques in k-critical graph

Room B332
IBS (기초과학연구원)

Loading view.

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 …

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 …

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 …

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 …

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 …

We show a flow-augmentation algorithm in directed graphs: There exists a polynomial-time algorithm that, given a directed graph G, two integers $s,t\in V(G)$, and an integer $k$, adds (randomly) to …

Property testers are probabilistic algorithms aiming to solve a decision problem efficiently in the context of big-data. A property tester for a property P has to decide (with high probability …

A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, …

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most …