Approximate min–max relations for odd cycles in planar graphs

We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that this ratio is at most 10. For the corresponding edge version of this problem, Král and Voss recently proved that this ratio is at most 2; we also give a short proof of their result. This work was supported by FNRS, NSERC (PGS Master award, Canada Research Chair in Graph Theory, award 288334-04) and FQRNT (award 2005-NC-98649).     

The Erd?s-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

We prove that for any orientable surface S and any non-negative integer k, there exists an integer f_S(k) such that every graph G embeddable in S has either k vertex-disjoint odd cycles or a vertex set A of cardinality at most f_S(k) such that G-A is bipartite. Such a property is called the Erd?s-Pósa property for odd cycles. We also show its edge version. As Reed [Mangoes and blueberries, Combinatorica 19 (1999) 267-296] pointed out, the Erd?s-Pósa property for odd cycles do not hold for all non-orientable surfaces.     

New upper bound for multicolor Ramsey number of odd cycles

Let $r_k\left(C_{2m+1}\right)$ be the $k$-color Ramsey number of an odd cycle $C_{2m+1}$ of length $2m+1$. It is shown that for each fixed $m\ge 2$, $r_k\left(C_{2m+1}\right)<c^k\sqrt{k!}$for all sufficiently large $k$, where $c=c\left(m\right)>0$ is a constant. This improves an old result by Bondy and Erd?s (1973).     

A multipartite Ramsey number for odd cycles

In this article we study multipartite Ramsey numbers for odd cycles. Our main result is the proof that a conjecture of Gyárfás et al. (J Graph Theory 61 (2009), 12–21), holds for graphs with a large enough number of vertices. Precisely, there exists n₀ such that if n?n₀ is a positive odd integer then any two‐coloring of the edges of the complete five‐partite graph K_{(n ? 1)/2, (n ? 1)/2, (n ? 1)/2, (n ? 1)/2, 1} contains a monochromatic cycle of length n. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Finding odd cycle transversals

We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle transversal of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k.     

A limit theorem for the Shannon capacities of odd cycles I

This paper contains a construction for independent sets in the powers of odd cycles. It follows from this construction that the limit as goes to infinity of is zero, where is the Shannon capacity of the graph .

     

A polynomial algorithm for the max-cut problem on graphs without long odd cycles

Given a graphG=[V, E] with positive edge weights, the max-cut problem is to find a cut inG such that the sum of the weights of the edges of this cut is as large as possible. Letg(K) be the class of graphs whose longest odd cycle is not longer than2K+1, whereK is a nonnegative integer independent of the numbern of nodes ofG. We present an O(n ^4K) algorithm for the max-cut problem for graphs ing(K). The algorithm is recursive and is based on some properties of longest and longest odd cycles of graphs. This research was supported by National Science Foundation Grant ECS-8005350 to Cornell University.     

A limit theorem for the Shannon capacities of odd cycles. II

It follows from a construction for independent sets in the powers of odd cycles given in the predecessor of this paper that the limit as goes to infinity of is zero, where is the Shannon capacity of a graph . This paper contains a shorter proof of this limit theorem that is based on an `expansion process' introduced in an older paper of L. Baumert, R. McEliece, E. Rodemich, H. Rumsey, R. Stanley and H. Taylor. We also refute a conjecture from that paper, using ideas from the predecessor of this paper.

     

decay problem for the dissipative wave equation in odd dimensions

Consider the Cauchy problem in odd dimensions for the dissipative wave equation: (□+∂_t)u=0 in with (u,∂_tu)|_t=0=(u₀,u₁). Because the L² estimates and the L^∞ estimates of the solution u(t) are well known, in this paper we pay attention to the L^p estimates with 1p<2 (in particular, p=1) of the solution u(t) for t0. In order to derive L^p estimates we first give the representation formulas of the solution u(t)=∂_tS(t)u₀+S(t)(u₀+u₁) and then we directly estimate the exact solution S(t)g and its derivative ∂_tS(t)g of the dissipative wave equation with the initial data (u₀,u₁)=(0,g). In particular, when p=1 and n1, we get the L¹ estimate: u(t)_L¹Ce^−t/4(u_0W^n,1+u_1W^n−1,1)+C(u_0L¹+u_1L¹) for t0.     

Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

An efficient method to generate all edge sets XE of a graph G=(V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality 5, (iii) all chordless cycles, (iv) all Hamiltonian cycles.     

Odd connection and odd vertex-connection of graphs

In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and received a lot of attention. In this paper, we present a general concept of connection in graphs. As a particular case, we introduce the odd connection number and the odd vertex-connection number of a graph. Furthermore, we compute and study the odd connection number and the odd vertex-connection number of graphs of various graph classes.     

Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity d$d$ and odd girth g$g$, which are sharp for many values of d$d$ and g$g$. For d=g=5$d=g=5$, we characterize all extremal graphs.     

Connections between semidefinite relaxations of the max-cut and stable set problems

We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász’s theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations. This work was done while the author visited CWI, Amsterdam, The Netherlands. Svata Poljak untimely deceased in April 1995. We shall both miss Svata very much. Svata was an excellent colleague, from whom we learned a lot of mathematics and with whom working was always a very enjoyable experience; above all, Svata was a very nice person and a close friend of us. The research was partly done while the author visited CWI, Amsterdam, in October 1994 with a grant fom the Stieltjes Institute, whose support is gratefully acknowledged. Partially supported also by GACR 0519. Research support by Christian Doppler Laboratorium für Diskrete Optimierung.     

Checking the odd Goldbach conjecture up to

Vinogradov's theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to check this conjecture up to .

     

Exploring the Relationship Between Max-Cut and Stable Set Relaxations

The max-cut and stable set problems are two fundamental -hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set problem can be easily transformed into a max-cut instance. Moreover, Laurent, Poljak, Rendl and others have shown that any convex set containing the cut polytope yields, via a suitable projection, a convex set containing the stable set polytope. We review this work, and then extend it in the following ways. We show that the rounded version of certain `positive semidefinite' inequalities for the cut polytope imply, via the same projection, a surprisingly large variety of strong valid inequalities for the stable set polytope. These include the clique, odd hole, odd antihole, web and antiweb inequalities, and various inequalities obtained from these via sequential lifting. We also examine a less general class of inequalities for the cut polytope, which we call odd clique inequalities, and show that they are, in general, much less useful for generating valid inequalities for the stable set polytope. As well as being of theoretical interest, these results have algorithmic implications. In particular, we obtain as a by-product a polynomial-time separation algorithm for a class of inequalities which includes all web inequalities.