Domagoj Bradač, Effective bounds for induced size-Ramsey numbers of cycles
The k-color induced size-Ramsey number of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
2023 Vertex-Minor Workshop
SONO BELLE JejuThis workshop aims to foster collaborative discussions and explore the various aspects of vertex-minors, including structural theory and their applications. This event will be small-scale, allowing for focused talks and …
-
Matija Bucić, Essentially tight bounds for rainbow cycles in proper edge-colourings
Room B332 IBS (기초과학연구원)An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the …
-
Robert Hickingbotham, Powers of planar graphs, product structure, and blocking partitions
Room B332 IBS (기초과학연구원)Graph product structure theory describes complex graphs in terms of products of simpler graphs. In this talk, I will introduce this subject and talk about some of my recent results …
-
James Davies, Odd distances in colourings of the plane
Room B332 IBS (기초과학연구원)We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd integral distance from each other.
-
-
The 3rd East Asia Workshop on Extremal and Structural Graph Theory
The Southern Beach Hotel & Resort OkinawaThe 3rd East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the …
-
Bruce A. Reed, Some Variants of the Erdős-Sós Conjecture
Room B332 IBS (기초과학연구원)Determining the density required to ensure that a host graph G contains some target graph as a subgraph or minor is a natural and well-studied question in extremal combinatorics. The …
-
Seunghun Lee (이승훈), On colorings of hypergraphs embeddable in $\mathbb{R}^d$
Room B332 IBS (기초과학연구원)Given a hypergraph $H=(V,E)$, we say that $H$ is (weakly) $m$-colorable if there is a coloring $c:V\to $ such that every hyperedge of $H$ is not monochromatic. The (weak) chromatic …
-
Hyunwoo Lee (이현우), Towards a high-dimensional Dirac’s theorem
Room B332 IBS (기초과학연구원)Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger …
-
-
Ben Lund, Almost spanning distance trees in subsets of finite vector spaces
Room B332 IBS (기초과학연구원)For $d\ge 2$ and an odd prime power $q$, let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb{F}_q$. The distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is …