Chong Shangguan (上官冲), The hat guessing number of graphs
Room B332 IBS (기초과학연구원)Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ …
10 events found.
Discrete Math Seminar
-
-
-
-
Tuan Tran, Complexity of null dynamical systems
Room B109 IBS (기초과학연구원)A theoretical dynamical system is a pair (X,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system …
-
Xuding Zhu (朱緒鼎), List version of 1-2-3 conjecture
Room B109 IBS (기초과학연구원)The well-known 1-2-3 Conjecture by Karoński, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1, 2 or 3 …
-
Andrzej Grzesik, Rainbow Turán problems
Room S221 IBS (기초과학연구원) Science Culture CenterIn a rainbow variant of the Turán problem, we consider $k$ graphs on the same set of vertices and want to determine the smallest possible number of edges in each …
-
Dong Yeap Kang (강동엽), Hamilton cycles and optimal matchings in a random subgraph of uniform Dirac hypergraphs
Room B332 IBS (기초과학연구원)A loose cycle is a cyclic ordering of edges such that every two consecutive edges share exactly one vertex. A cycle is Hamilton if it spans all vertices. A codegree …
-
-
Daniel Kráľ, High chromatic common graphs
Room B332 IBS (기초과학연구원)Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. As probabilistic constructions often provide good bounds on …
-
R. Amzi Jeffs, Intersection patterns of convex sets
Room B332 IBS (기초과학연구원)How can one arrange a collection of convex sets in d-dimensional Euclidean space? This guiding question is fundamental in discrete geometry, and can be made concrete in a variety of …
-
Linda Cook, Orientations of $P_4$ bind the dichromatic number
Room B332 IBS (기초과학연구원)An oriented graph is a digraph that does not contain a directed cycle of length two. An (oriented) graph $D$ is $H$-free if $D$ does not contain $H$ as an …
-
Dabeen Lee (이다빈), From coordinate subspaces over finite fields to ideal multipartite uniform clutters
Room B332 IBS (기초과학연구원)Take a prime power $q$, an integer $n\geq 2$, and a coordinate subspace $S\subseteq GF(q)^n$ over the Galois field $GF(q)$. One can associate with $S$ an $n$-partite $n$-uniform clutter $\mathcal{C}$, …
-
-
Sebastian Wiederrecht, Delineating half-integrality of the Erdős-Pósa property for minors
Room B332 IBS (기초과학연구원)In 1986, Robertson and Seymour proved a generalization of the seminal result of Erdős and Pósa on the duality of packing and covering cycles: A graph has the Erdős-Pósa property …