Sang June Lee (이상준), On strong Sidon sets of integers
Room B232 IBS (기초과학연구원)Let $\mathbb N$ be the set of natural numbers. A set $A\subset \mathbb N$ is called a Sidon set if the sums $a_1+a_2$, with $a_1,a_2\in S$ and $a_1\leq a_2$, are …
10 events found.
Seminars and Colloquiums
-
-
-
Xin Zhang (张欣), On equitable tree-colorings of graphs
Room B232 IBS (기초과학연구원)An equitable tree-$k$-coloring of a graph is a vertex coloring using $k$ distinct colors such that every color class (i.e, the set of vertices in a common color) induces a …
-
Lars Jaffke, A complexity dichotomy for critical values of the b-chromatic number of graphs
Room B232 IBS (기초과학연구원)A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the …
-
-
Jinyoung Park (박진영), The number of maximal independent sets in the Hamming cube
Room B232 IBS (기초과학연구원)Let $Q_n$ be the $n$-dimensional Hamming cube (hypercube) and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically $2n2^{N/4}$, as was conjectured by Ilinca and …
-
Suil O (오수일), An odd [1,b]-factor in regular graphs from eigenvalues
Room B232 IBS (기초과학연구원)An odd $$-factor of a graph is a spanning subgraph $H$ such that for every vertex $v \in V(G)$, $1 \le d_H(v) \le b$, and $d_H(v)$ is odd. For positive integers $r …
-
Patrice Ossona de Mendez, A model theoretical approach to sparsity
Room B232 IBS (기초과학연구원)We discuss how the model theoretic notion of first-order transduction allows to define a notion of structural sparsity, and give some example of applications, like existence of low shrub-depth decompositions …
-
-
Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors
Room B232 IBS (기초과학연구원)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 …
-
-
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 …