Felix Christian Clemen, Triangles in the Plane
Room B332 IBS (기초과학연구원)A classical problem in combinatorial geometry, posed by Erdős in 1946, asks to determine the maximum number of unit segments in a set of
A classical problem in combinatorial geometry, posed by Erdős in 1946, asks to determine the maximum number of unit segments in a set of
We will give an overview of the recent attempts of building a structure theory for graphs centered around First-Order transductions: a notion of containment inspired by finite model theory. Particularly, …
The IBS-DIMAG Workshop on Topology and Combinatorics will be held on November 11, 2024 at Room B332, Institute for Basic Science (IBS), Daejeon, South Korea. Invited Speakers (tentative) Karim Adiprasito …
Ehrhart theory is the study of lattice polytopes, specifically aimed at understanding how many lattice points are inside dilates of a given lattice polytope, and the study has a wide …
In 2005, Bollobás, Janson and Riordan introduced and extensively studied a general model of inhomogeneous random graphs parametrised by graphons. In particular, they studied the emergence of a giant component …
An
For a positive real number
An edge-weighted graph
In 1966, Kleitman established that if
A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman's celebrated theorem …