Let $a$ and $b$ be positive integers. An even $[a,b]-$factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \in V(G)$, $d_H(v)$ is even and $a \le d_H(v) \le b$. In 2005, Matsuda proposed a conjecture on a sufficient condition for the existence of an even $[a,b]$-factor. He proved that the conjecture is true when $a = 2$ and $ n \geq b+3$. In this talk, we show that the conjecture does not hold when $a = 2$ and $n = b+2$ or $a > 2$ by presenting counterexamples and prove some sharp sufficient conditions for the existence of an even $[a,b]$-factor in a graph.

This is joint work with Jong Yoon Hyun, Suil O, and Jeong-Rye Park.

In this talk, we study what about the web crawling and scraping for data. We briefly introduce how to use Python. By using Python, we practice to bring the data in a website.

In this talk, we study what about the web crawling and scraping for data. We briefly introduce how to use Python. By using Python, we practice to bring the data in a website.

Given a root system, the Weyl chambers in the co-weight lattice give rise to a real toric variety, called the real toric variety associated to the Weyl chambers. We compute the integral cohomology groups of real toric varieties associated to the Weyl chambers of classical types.

Let $\lambda_2(G)$ be the second largest eigenvalue of a graph $G$, and let $\kappa'(G)$ be the minimum size of an edge set $S$ such that $G-S$ is disconnected. For $t=1$ or $2$, Cioaba determined the best upper bounds for $\lambda_2(G)$ in a $d$-regular simple graph $G$ to guarantee that $\kappa'(G) \ge t+1$. In this talk, we give the best upper bounds for all $t \ge 3$.

This is joint work with Jongyook Park, Jungrae Park, and Hyunju Yu.