Related papers: A note on "Folding wheels and fans."

An error is spotted in the statement of Theorem~1.3 of our published article titled "On oriented cliques with respect to push operation" (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to…

This erratum aims to correct 1) the wrong expressions, 2) some typographical errors, 3) some erroneous points made in discussion of the disparity of heat flux ratios between our full RPA model and the local conductivity model, and 4) the…

King, Lu, and Peng recently proved that for $\Delta\geq 4$, any $K_\Delta$-free graph with maximum degree $\Delta$ has fractional chromatic number at most $\Delta-\tfrac{2}{67}$ unless it is isomorphic to $C_5\boxtimes K_2$ or $C_8^2$.…

The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The…

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

A family of closed subsets of a topological space $X$ is called a (strict) $Cld$-fan in $X$ if this family is (strictly) compact-finite but not locally finite in $X$. Applications of (strict) $Cld$-fans are based on a simple observation…

Let G be a graph. Consider two nonadjacent vertices x and y that have a common neighbor. Folding G with respect to x and y is the operation which identifies x and y. After a maximal series of foldings the graph is a disjoint union of…

The category of (abstract) fans is to the category of monoids what the category of schemes is to the category of rings: a fan is obtained by gluing spectra of monoids along open embeddings. Here we study the basic algebraic geometry of…

Reed conjectured that for every epsilon>0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at most Delta+1+epsilon. We prove the conjecture for Delta=3 and…

We prove that for every $t\in \mathbb{N}$ there is a constant $\gamma_t$ such that every graph with twin-width at most $t$ and clique number $\omega$ has chromatic number bounded by $2^{\gamma_t \log^{4t+3} \omega}$. In other words, we…

This paper is concerned with two conjectures which are intimately related. The first is a generalization to hypergraphs of Vizing's Theorem on the chromatic index of a graph and the second is the well-known conjecture of Erd\H{o}s, Faber…

We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we…

We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…

Let $\phi(n,H)$ be the largest integer such that, for all graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\phi(n, H)$ parts, of which every part either is a single edge or forms a graph isomorphic to $H$.…

An edge coloring of a graph $G$ is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least three colors. Fiam{\v{c}}ik (1978) and Alon, Sudakov and…

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as…

The derivation of Marko and Siggia's interpolation formula for the force-extension relation of the Worm-Like Chain Model (C.Bustamante, J.F.Marko, E.D.Siggia, and S.Smith, Science Vol.265, p.1599 (1994); J.F.Marko and E.D.Siggia,…

The chromatic threshold delta_chi(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for which every H-free graph G with minimum degree at least d|G| satisfies chi(G)<C. We prove that delta_chi(H) \in {(r-3)/(r-2),…

A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a $P_5$-free graph with clique number $\omega\ge 3$ has chromatic number at most $\omega^{\log_2(\omega)}$. The best previous result was an exponential upper…

We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…