Tianchi Yang, On the maximum number of edges in k-critical graphs
In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
-
István Tomon, Configurations of boxes
Room B332 IBS (기초과학연구원)Configurations of axis-parallel boxes in $\mathbb{R}^d$ are extensively studied in combinatorial geometry. Despite their perceived simplicity, there are many problems involving their structure that are not well understood. I will …
-
Jie Han, Spanning trees in expanders
Zoom ID: 224 221 2686 (ibsecopro)We consider the spanning tree embedding problem in dense graphs without bipartite holes and sparse graphs. In 2005, Alon, Krivelevich and Sudakov asked for determining the best possible spectral gap …
-
James Davies, Two structural results for pivot-minors
Room B332 IBS (기초과학연구원)Pivot-minors can be thought of as a dense analogue of graph minors. We shall discuss pivot-minors and two recent results for proper pivot-minor-closed classes of graphs. In particular, that for …
-
MATRIX-IBS Workshop: Structural Graph Theory Downunder III
MATRIX, AustraliaWebsite: https://www.matrix-inst.org.au/events/structural-graph-theory-downunder-iii/ Program Description: This program, jointly organised by MATRIX and the Discrete Mathematics Group of the Korean Institute for Basic Science (IBS), builds on the “Structural Graph Theory Downunder” …
-
Shin-ichiro Seki, On the extension of the Green-Tao theorem to number fields
Zoom ID: 897 6822 0619 (ibsecopro) [04/19 only]In 2006, Tao established the Gaussian counterpart of the celebrated Green-Tao theorem on arithmetic progressions of primes. In this talk, I will explain the extension of Tao's theorem and the …
-
Hyunwoo Lee (이현우), On perfect subdivision tilings
Room B332 IBS (기초과학연구원)For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of …
-
Rob Morris, Ramsey theory: searching for order in chaos
Room 1501, Bldg. E6-1, KAISTIn many different areas of mathematics (such as number theory, discrete geometry, and combinatorics), one is often presented with a large "unstructured" object, and asked to find a smaller "structured" …
-
-
Rob Morris, An exponential improvement for diagonal Ramsey
Room B332 IBS (기초과학연구원)The Ramsey number $R(k)$ is the minimum n such that every red-blue colouring of the edges of the complete graph on n vertices contains a monochromatic copy of $K_k$. It …
-
Jozef Skokan, Separating the edges of a graph by a linear number of paths
Room B332 IBS (기초과학연구원)Recently, Letzter proved that any graph of order n contains a collection P of $O(n \log^*n)$ paths with the following property: for all distinct edges e and f there exists …