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

Skip to content
#
Seminars and Colloquiums

##

###
Sepehr Hajebi, Holes, hubs and bounded treewidth

Zoom ID: 869 4632 6610 (ibsdimag)
###
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 …

###
Noam Lifshitz, Product free sets in the alternating group

Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]
##

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

Room B332
IBS (기초과학연구원)
###
Lars Jaffke, Taming graphs with no large creatures and skinny ladders

Zoom ID: 869 4632 6610 (ibsdimag)
###
Eun Jung Kim (김은정), Directed flow-augmentation

Room B332
IBS (기초과학연구원)
###
Akash Kumar, Random walks and Forbidden Minors

Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]
###
Noleen Köhler, Testing first-order definable properties on bounded degree graphs

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

Loading view.

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 …

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 …

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 …

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

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 …

Random walks and spectral methods have had a strong influence on modern graph algorithms as evidenced by the extensive literature on the subject. In this talk, I will present how …

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 …