## Seminars and Colloquia by Series

### Anti-Ramsey number of edge-disjoint rainbow spanning trees

Series
Graph Theory Seminar
Time
Thursday, April 9, 2020 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Zhiyu WangUniversity of South Carolina

An edge-colored graph $G$ is called \textit{rainbow} if every edge of $G$ receives a different color. The \textit{anti-Ramsey} number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [{\em J. Graph Theory, 2016}] conjectured that for any fixed $t$, $r(n,t)=\binom{n-2}{2}+t$ whenever $n\geq 2t+2 \geq 6$. We show their conjecture is true and also determine $r(n,t)$ when $n = 2t+1$. Together with previous results, this gives the anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees for all values of $n$ and $t$. Joint work with Linyuan Lu.

### Counting critical subgraphs in k-critical graphs

Series
Graph Theory Seminar
Time
Thursday, October 3, 2019 - 13:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jie MaUniversity of Science and Technology of China

A graph is $k$-critical if its chromatic number is $k$ but any its proper subgraph has chromatic number less than $k$. Let $k\geq 4$. Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that every such graph contains $\Omega(n^{1/(k-1)})$ distinct $(k-1)$-critical subgraphs. Since then no progress had been made until very recently, Hare resolved the case $k=4$ by showing that any $4$-critical graph on $n$ vertices contains at least $(8n-29)/3$ odd cycles. We mainly focus on 4-critical graphs and develop some novel tools for counting cycles of specified parity. Our main result shows that any $4$-critical graph on $n$ vertices contains $\Omega(n^2)$ odd cycles, which is tight up to a constant factor by infinite many graphs. As a crucial step, we prove the same bound for 3-connected non-bipartite graphs, which may be of independent interest. Using the tools, we also give a very short proof to the Gallai's problem for the case $k=4$. Moreover, we improve the longstanding lower bound of Abbott and Zhou to $\Omega(n^{1/(k-2)})$ for the general case $k\geq 5$. Joint work with Tianchi Yang.

### Quasirandom permutations

Series
Graph Theory Seminar
Time
Friday, September 13, 2019 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 249
Speaker
Dan KralMasaryk University and University of Warwick

A combinatorial structure is said to be quasirandom if it resembles a random structure in a certain robust sense. For example, it is well-known that a graph G with edge-density p is quasirandom if and only if the density of C_4 in G is p^4+o(p^4); this property is known to equivalent to several other properties that hold for truly random graphs.  A similar phenomenon was established for permutations: a permutation is quasirandom if and only if the density of every 4-point pattern (subpermutation) is 1/4!+o(1).  We strengthen this result by showing that a permutation is quasirandom if and only if the sum of the densities of eight specific 4-point patterns is 1/3+o(1). More generally, we classify all sets of 4-point patterns having such property.

The talk is based on joint work with Timothy F. N. Chan, Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh and Jan Volec.

### Independent set permutations, and matching permutations

Series
Graph Theory Seminar
Time
Thursday, April 18, 2019 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
David GalvinUniversity of Notre Dam
To any finite real sequence, we can associate a permutation $\pi$, via: $\pi(k)$ is the index of the $k$th smallest element of the sequence. This association was introduced in a 1987 paper of Alavi, Malde, Schwenk and Erd\H{o}s, where they used it to study the possible patterns of rises and falls that can occur in the matching sequence of a graph (the sequence whose $k$th term is the number of matchings of size $k$), and in the independent set sequence. The main result of their paper was that {\em every} permutation can arise as the independent set permutation'' of some graph. They left open the following extremal question: for each $n$, what is the smallest order $m$ such that every permutation of $[n]$ can be realized as the independent set permutation of some graph of order at most $m$? We answer this question. We also improve Alavi et al.'s upper bound on the number of permutations that can be realized as the matching permutation of some graph. There are still many open questions in this area. This is joint work with T. Ball, K. Hyry and K. Weingartner, all at Notre Dame.

### Fractional coloring with local demands

Series
Graph Theory Seminar
Time
Thursday, April 11, 2019 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tom KellyUniversity of Waterloo

In a fractional coloring, vertices of a graph are assigned subsets of the [0, 1]-interval such that adjacent vertices receive disjoint subsets. The fractional chromatic number of a graph is at most k if it admits a fractional coloring in which the amount of "color" assigned to each vertex is at least 1/k. We investigate fractional colorings where vertices "demand" different amounts of color, determined by local parameters such as the degree of a vertex. Many well-known results concerning the fractional chromatic number and independence number have natural generalizations in this new paradigm. We discuss several such results as well as open problems. In particular, we will sketch a proof of a "local demands" version of Brooks' Theorem that considerably generalizes the Caro-Wei Theorem and implies new bounds on the independence number. Joint work with Luke Postle.

### On the number of cliques in graphs with a forbidden clique minor

Series
Graph Theory Seminar
Time
Thursday, March 28, 2019 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Fan WeiStanford University

### Limitations of Sums of Squares Method for Turan Problems

Series
Graph Theory Seminar
Time
Thursday, October 11, 2018 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Greg BlekhermanGeorgia Tech
A sum of squares of real numbers is always nonnegative. This elementary observation is quite powerful, and can be used to prove graph density inequalities in extremal combinatorics, which address so-called Turan problems. This is the essence of semidefinite method of Lov\'{a}sz and Szegedy, and also Cauchy-Schwartz calculus of Razborov. Here multiplication and addition take place in the gluing algebra of partially labelled graphs. This method has been successfully used on many occasions and has also been extensively studied theoretically. There are two competing viewpoints on the power of the sums of squares method. Netzer and Thom refined a Positivstellensatz of Lovasz and Szegedy by showing that if f> 0 is a valid graph density inequality, then for any a>0 the inequality f+a > 0 can be proved via sums of squares. On the other hand, Hatami and Norine showed that testing whether a graph density inequality f > 0 is valid is an undecidable problem, and also provided explicit but complicated examples of inequalities that cannot be proved using sums of squares. I will introduce the sums of squares method, do several examples of sums of squares proofs, and then present simple explicit inequalities that show strong limitations of the sums of squares method. This is joint work in progress with Annie Raymond, Mohit Singh and Rekha Thomas.

### The Grid Theorem for Vertex Minors

Series
Graph Theory Seminar
Time
Thursday, August 30, 2018 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Rose McCartyUniversity of Waterloo
Vertex minors are a weakening of the notion of induced subgraphs that benefit from many additional nice properties. In particular, there is a vertex minor version of Menger's Theorem proven by Oum. This theorem gives rise to a natural analog of branch-width called rank-width. Similarly to the Grid Theorem of Robertson and Seymour, we prove that a class of graphs has unbounded rank-width if and only if it contains all "comparability grids'' as vertex minors. This is joint work with Jim Geelen, O-joung Kwon, and Paul Wollan.