On graphs with a large chromatic number containing no small odd cycles

In this paper, we present the lower bounds for the number of vertices in a graph with a large chromatic number containing no small odd cycles

An Improved Upper Bound for the Ring Loading Problem

The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative demands between any pair of nodes, the Ring Loading Problem asks for an unsplittable routing of the demands such that the maximum cumulated demand on any edge is minimized. Let $L$ be the value of such a solution. In the relaxed version of the problem, each demand can be split into two parts where the first part is routed clockwise while the second part is routed counter-clockwise. Denote with $L^*$ the maximum load of a minimum split routing solution. In a landmark paper, Schrijver, Seymour and Winkler [SSW98] showed that $L \leq L^* + 1.5D$, where $D$ is the maximum demand value. They also found (implicitly) an instance of the Ring Loading Problem with $L = L^* + 1.01D$. Recently, Skutella [Sku16] improved these bounds by showing that $L \leq L^* + \frac{19}{14}D$, and there exists an instance with $L = L^* + 1.1D$. We contribute to this line of research by showing that $L \leq L^* + 1.3D$. We also take a first step towards lower and upper bounds for small instances

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c.Comment: v3: referees' comments incorporate

Bounding biomass in the Fisher equation

The FKPP equation with a variable growth rate and advection by an incompressible velocity field is considered as a model for plankton dispersed by ocean currents. If the average growth rate is negative then the model has a survival-extinction transition; the location of this transition in the parameter space is constrained using variational arguments and delimited by simulations. The statistical steady state reached when the system is in the survival region of parameter space is characterized by integral constraints and upper and lower bounds on the biomass and productivity that follow from variational arguments and direct inequalities. In the limit of zero-decorrelation time the velocity field is shown to act as Fickian diffusion with an eddy diffusivity much larger than the molecular diffusivity and this allows a one-dimensional model to predict the biomass, productivity and extinction transitions. All results are illustrated with a simple growth and stirring model.Comment: 32 Pages, 13 Figure

Critical Casimir effect and wetting by helium mixtures

We have measured the contact angle of the interface of phase-separated $^{3}$He-$^{4}$He mixtures against a sapphire window. We have found that this angle is finite and does not tend to zero when the temperature approaches $T_t$, the temperature of the tri-critical point. On the contrary, it increases with temperature. This behavior is a remarkable exception to what is generally observed near critical points, i.e. "critical point wetting''. We propose that it is a consequence of the "critical Casimir effect'' which leads to an effective attraction of the $^{3}$He-$^{4}$He interface by the sapphire near $T_{t}$.Comment: submitted july 13 (2002), published march 20 (2003

Open problems on graph coloring for special graph classes.

For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c:V→{1,2,…}c:V→{1,2,…} such that c(u)≠c(v)c(u)≠c(v) for every edge uv∈Euv∈E. We survey known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring

Effect of spatial configuration of an extended nonlinear Kierstead-Slobodkin reaction-transport model with adaptive numerical scheme

In this paper, we consider the numerical simulations of an extended nonlinear form of Kierstead-Slobodkin reaction-transport system in one and two dimensions. We employ the popular fourth-order exponential time differencing Runge-Kutta (ETDRK4) schemes proposed by Cox and Matthew (J Comput Phys 176:430-455, 2002), that was modified by Kassam and Trefethen (SIAM J Sci Comput 26:1214-1233, 2005), for the time integration of spatially discretized partial differential equations. We demonstrate the supremacy of ETDRK4 over the existing exponential time differencing integrators that are of standard approaches and provide timings and error comparison. Numerical results obtained in this paper have granted further insight to the question "What is the minimal size of the spatial domain so that the population persists?" posed by Kierstead and Slobodkin (J Mar Res 12:141-147, 1953 ), with a conclusive remark that the popula- tion size increases with the size of the domain. In attempt to examine the biological wave phenomena of the solutions, we present the numerical results in both one- and two-dimensional space, which have interesting ecological implications. Initial data and parameter values were chosen to mimic some existing patternsScopus 201