Given a set and a point in a vector space over a finite field, the radial projection of from is the set of lines that through and points of . Clearly, is at most the minimum of the number of lines through and . I will discuss …
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 will look at some recent progress and approaches to constructing hypergraph families with at least two different extremal constructions. Based on some joint work with …
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 sample from the equilibrium distribution of the model or equivalently approximate the corresponding normalizing factor known as the partition function. We show that when correlations die …
A hole in a graph is an induced cycle of length at least four, and for every hole in , a vertex is called a -hub for if has at least neighbor in . Sintiari and Trotignon were the first to construct graphs with arbitrarily large treewidth …
The strong product of graphs and is the graph on the cartesian product such that vertices and are adjacent if and only if . Graph product structure theory aims to describe complicated graphs in terms of subgraphs of strong products of simpler graphs. This area of research was initiated …
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 finite set, its threshold is never far from its "expectation-threshold," which is a natural (and often easy to calculate) lower bound on the threshold. …
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 finite set, its threshold is never far from its "expectation-threshold," which is a natural (and often easy to calculate) lower bound on the threshold. …
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 free subset of be? In the talk we will completely solve the problem by determining the largest product free subset of . Our proof …
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 order types. We first show that every simple order type with at most 2 interior points is inscribable, and that the number of such order …
We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class there exists a constant such that no member of contains a -creature as an induced subgraph or a -skinny-ladder as an induced minor, then there exists a polynomial such that every contains at …
