Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors
Given a finite set of elements $V$ and a family $\mathcal{C}$ of subsets of $V$, the set covering problem is to find a minimum cardinality subset of $V$ intersecting every …
10 events found.
Discrete Math Seminar
Events
-
-
Room B232 IBS (기초과학연구원)
-
-
Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
Room B232 IBS (기초과학연구원)In this talk we shall discuss how quickly the genus of the Erdős-Rényi random graph grows as the number of edges increases and how dramatically a small number of random edges …
-
-
Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Room B232 IBS (기초과학연구원)Given a graph $G$, we define $\textrm{ex}_c(G)$ to be the minimum value of $t$ for which there exists a constant $N(t,G)$ such that every $t$-connected graph with at least $N(t,G)$ …
-
Cory Palmer, A survey of Turán-type subgraph counting problems
Room B232 IBS (기초과학연구원)Let $F$ and $H$ be graphs. The subgraph counting function $\operatorname{ex}(n,H,F)$ is defined as the maximum possible number of subgraphs $H$ in an $n$-vertex $F$-free graph. This function is a …
-
-
Casey Tompkins, Extremal problems for Berge hypergraphs
Room B232 IBS (기초과학연구원)Given a graph $G$, there are several natural hypergraph families one can define. Among the least restrictive is the family $BG$ of so-called Berge copies of the graph $G$. In …
-
Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
Room B232 IBS (기초과학연구원)A graph or graph property is $\ell$-reconstructible if it is determined by the multiset of all subgraphs obtained by deleting $\ell$ vertices. Apart from the famous Graph Reconstruction Conjecture, Kelly conjectured in …
-
Zi-Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
Room B232 IBS (기초과학연구원)For a graph $H$ and an integer $k\ge1$, the $k$-color Ramsey number $R_k(H)$ is the least integer $N$ such that every $k$-coloring of the edges of the complete graph $K_N$ …
-
Joonkyung Lee (이준경), On some properties of graph norms
Room B232 IBS (기초과학연구원)For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t_H(W)$. One may then define …
-
Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Room B232 IBS (기초과학연구원)Given a cardinal $\lambda$, a $\lambda$-packing of a graph $G$ is a family of $\lambda$ many edge-disjoint spanning trees of $G$, and a $\lambda$-covering of $G$ is a family of spanning …
-
-
Sun Kim (김선), Two identities in Ramanujan’s Lost Notebook with Bessel function series
Room 1401, Bldg. E6-1, KAISTOn page 335 in his lost notebook, Ramanujan recorded without proofs two identities involving finite trigonometric sums and doubly infinite series of Bessel functions. We proved each of these identities …