Loading Events

Past Events › Discrete Math Seminar

Events Search and Views Navigation

Event Views Navigation

June 2019

:

Suil O (오수일), An odd [1,b]-factor in regular graphs from eigenvalues

Speaker

Suil O (오수일)
Department of Applied Mathematics and Statistics, SUNY-Korea
https://you.stonybrook.edu/suilo/
June 19 Wednesday @ 4:30 PM - 5:30 PM
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 \ge 3$ and $b \le r$, Lu, Wu, and Yang gave an upper bound for the third largest eigenvalue in an $r$-regular graph with even number of vertices to guarantee the existence of an odd -factor. In this talk, we improve their bound.

Find out more »
:

Patrice Ossona de Mendez, A model theoretical approach to sparsity

June 25 Tuesday @ 4:30 PM - 5:30 PM
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 for tranductions of bounded expansion classes, characterization of transductions of classes with bounded pathwidth, decompositions of graphs with bounded rank-width into cographs.

Find out more »

July 2019

:

Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors

Speaker

July 16 Tuesday @ 4:30 PM - 5:30 PM
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 subset in the family $\mathcal{C}$. The set covering problem, also known as the hitting set problem, admits a simple integer linear programming formulation. The constraint system of the integer linear programming formulation defines a polyhedron, and we call it the set covering polyhedron of $\mathcal{C}$. We say that a set…

Find out more »

August 2019

:

Mihyun Kang (강미현), The genus of a random graph and the fragile genus property

August 20 Tuesday @ 4:30 PM - 5:30 PM
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 can increase the genus of a randomly perturbed graph. (Joint work with Chris Dowden and Michael Krivelevich)

Find out more »

September 2019

:

Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs

Speaker

September 10 Tuesday @ 4:30 PM - 5:30 PM
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)$ vertices contains $G$ as a minor. The value of $\textrm{ex}_c(G)$ is known to be tied to the vertex cover number $\tau(G)$, and in fact $\tau(G)\leq \textrm{ex}_c(G)\leq \frac{31}{2}(\tau(G)+1)$. We give the precise value of $\textrm{ex}_c(G)$ when $G$ is a forest. In particular we find that $\textrm{ex}_c(G)\leq \tau(G)+2$ in this setting, which…

Find out more »
:

Cory Palmer, A survey of Turán-type subgraph counting problems

Speaker

Cory T. Palmer
University of Montana, Missoula, MT
http://www.math.umt.edu/palmer/
September 19 Thursday @ 4:30 PM - 5:30 PM
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 direct generalization of the Turán function as $\operatorname{ex}(n,F)=\operatorname{ex}(n,K_2,F)$. The systematic study of $\operatorname{ex}(n,H,F)$ was initiated by Alon and Shikhelman in 2016 who generalized several classical results in extremal graph theory to the subgraph counting setting. Prior to their paper, a number of individual cases were investigated; a well-known example is…

Find out more »

October 2019

:

Casey Tompkins, Extremal problems for Berge hypergraphs

Speaker

October 1 Tuesday @ 4:30 PM - 5:30 PM
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 this talk, we discuss Turán problems for families $BG$ in $r$-uniform hypergraphs for various graphs $G$. In particular, we are interested in general results in two settings: the case when $r$ is large and $G$ is any graph where this Turán number is shown to be eventually subquadratic, as well…

Find out more »
:

Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs

Speaker

Alexandr V. Kostochka
University of Illinois at Urbana-Champaign
https://faculty.math.illinois.edu/~kostochk/
October 8 Tuesday @ 4:30 PM - 5:30 PM
Room 1501, Bldg. E6-1, KAIST

A well-known Ramsey-type puzzle for children is to prove that among any 6 people either there are 3 who know each other or there are 3 who do not know each other. More generally, a graph $G$ arrows a graph $H$ if for any coloring of the edges of $G$ with two colors, there is a monochromatic copy of $H$. In these terms, the above puzzle claims that the complete $6$-vertex graph $K_6$ arrows the complete $3$-vertex graph $K_3$. We consider sufficient…

Find out more »
:

Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs

Speaker

Alexandr V. Kostochka
University of Illinois at Urbana-Champaign
https://faculty.math.illinois.edu/~kostochk/
October 10 Thursday @ 4:30 PM - 5:30 PM
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 1957 that for each $\ell\in\mathbb N$, there is an integer $n=n(\ell)$ such that every graph with at least $n$ vertices is $\ell$-reconstructible. We show that for each $n\ge7$ and every $n$-vertex graph $G$, the degree list and connectedness of $G$ are $3$-reconstructible, and the threshold $n\geq 7$ is sharp for both properties.‌ We…

Find out more »
:

Zi-Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings

Speaker

October 15 Tuesday @ 4:30 PM - 5:30 PM
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$ contains a monochromatic copy of $H$. Let $C_m$ denote the cycle on $m\ge4 $ vertices. For odd cycles, Bondy and Erd\H{o}s in 1973 conjectured that for all $k\ge1$ and $n\ge2$, $R_k(C_{2n+1})=n\cdot 2^k+1$. Recently, this conjecture has been verified to be true for all fixed $k$ and all $n$ sufficiently large…

Find out more »
+ Export Events