Related papers: Closing Trees into Unicyclic Counterexamples

We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\cal C$ of graphs that…

We extend McClure's results on the restriction maps in equivariant $K$-theory to bivariant $K$-theory: Let $G$ be a compact Lie group and $A$ and $B$ be $G$-$C^*$-algebras. Suppose that $KK^{H}_{n}(A, B)$ is a finitely generated…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…

We study off-diagonal Ramsey numbers $r(H, K_n^{(k)})$ of $k$-uniform hypergraphs, where $H$ is a fixed linear $k$-uniform hypergraph and $K_n^{(k)}$ is complete on $n$ vertices. Recently, Conlon et al.\ disproved the folklore conjecture…

For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map…

We study the class of $\K$-Lorentzian polynomials, a generalization of the distinguished class of Lorentzian polynomials. As shown in \cite{GPlorentzian}, the set of $\K$-Lorentzian polynomials is equivalent to the set of $\K$-completely…

We prove that for fixed $r\ge k\ge 2$, every $k$-uniform hypergraph on $n$ vertices having minimum codegree at least $(1-(\binom{r-1}{k-1}+\binom{r-2}{k-2})^{-1})n+o(n)$ contains the $(r-k+1)$th power of a tight Hamilton cycle. This result…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

The Grothendieck classes of melonic graphs satisfy a recursive relation and may be written as polynomials in the class of the moduli space $\mathcal{M}_{0,4}$ with nonnegative integer coefficients, conjectured to be log-concave. In this…

Balogh, Bollob\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic…

We provide a programmable recursive algorithm for the $\mathbb{S}_n$-representations on the cohomology of the moduli spaces $\overline{\mathcal M}_{0,n}$ of $n$-pointed stable curves of genus 0. As an application, we find explicit inductive…

Let K be a field and t>=0. Denote by Bm(t,K) the maximum number of non-zero roots in K, counted with multiplicities, of a non-zero polynomial in K[x] with at most t+1 monomial terms. We prove, using an unified approach based on Vandermonde…

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…

Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [JT07]. However, for graphs of tree-width larger than 2, no bound better than NL is known. In this paper, we…

We prove that primal-dual log-barrier interior point methods are not strongly polynomial, by constructing a family of linear programs with $3r+1$ inequalities in dimension $2r$ for which the number of iterations performed is in…

We show that every $H$-minor-free graph that also excludes a $(k \times k)$-grid as a minor has treewidth/branchwidth bounded from above by a function $f(t,k)$ that is linear in $k$ and polynomial in $t := |V(H)|$. Such a result was proven…

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

For a tree $T$, let $i_T(t)$ be the number of independent sets of size $t$ in $T$. It is an open question, raised by Alavi, Malde, Schwenk and Erd\H{o}s, whether the sequence $(i_T(t))_{t \geq 0}$ is always unimodal. Here we answer the…