How Tight Is the Bollobás-Komlós Conjecture?

The bipartite case of the Bollobás and Komlós conjecture states that for every j₀, %>0 there is an !=!(j₀, %) >0 such that the following statement holds: If G is any graph with minimum degree at least n$\displaystyle {n \over 2}+%n then G contains as subgraphs all n vertex bipartite graphs, H, satisfying¶H)hj₀ \quad {\rm and} \quad b(H)h!n.$j (H)hj₀ \quad {\rm and} \quad b(H)h!n.¶Here b(H), the bandwidth of H, is the smallest b such that the vertices of H can be ordered as v₁, …, v_n such that v_i~_Hv_j implies |imj|hb.¶ This conjecture has been proved in [1]. Answering a question of E. Szemerédi [6] we show that this conjecture is tight in the sense that as %̂ then !̂. More precisely, we show that for any 0 such that that !(j₀, %)Д %.     

(2, 3, k)-generated groups of large rank

For any fixed k 3 7k \geq 7 there exist integers n_k and a_k such that if the ring R is generated by a set of m elements t₁,...,t_m, where 2t₁-t₁²2t_1-t_1^2 is a unit of finite multiplicative order, and n 3 n_k+ma_kn \geq n_k+ma_k, then the group E_n(R) generated by elementary transvections is an epimorphic image of the triangle group D(2,3,k).\Delta (2,3,k).     

Properly colored hamilton cycles in edge-colored complete graphs

It is shown that, for ϵ>0 and n>n₀(ϵ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1-1/\sqrt2-\epsilon)n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and n any such K contains a cycle of length k in which adjacent edges have distinct colors. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 179–186 (1997)     

Extension theorems for functional equations with bisymmetric operations

Summary. In this paper we deal with the extension of the following functional equation¶¶ f (x) = M (f (m₁(x, y)), ..., f (m_k(x, y)))        (x, y ? K) f (x) = M \bigl(f (m_{1}(x, y)), \dots, f (m_{k}(x, y))\bigr) \qquad (x, y \in K) , (*)¶ where M is a k-variable operation on the image space Y, m₁,..., m_k are binary operations on X, K ì X K \subset X is closed under the operations m₁,..., m_k, and f : K ? Y f : K \rightarrow Y is considered as an unknown function.¶ The main result of this paper states that if the operations m₁,..., m_k, M satisfy certain commutativity relations and f satisfies (*) then there exists a unique extension of f to the (m₁,..., m_k)-affine hull K^* of K, such that (*) holds over K^*. (The set K^* is defined as the smallest subset of X that contains K and is (m₁,..., m_k)-affine, i.e., if x ? X x \in X , and there exists y ? K^* y \in K^* such that m₁(x, y), ?, m_k(x, y) ? K^* m_{1}(x, y), \ldots, m_{k}(x, y) \in K^* then x ? K^* x \in K^* ). As applications, extension theorems for functional equations on Abelian semigroups, convex sets, and symmetric convex sets are obtained.     

On a question of Erdös and Graham

We prove that for any $ \varepsilon > 0 $ \varepsilon > 0 there is k (e) k (\varepsilon) such that for any prime p and any integer c there exist k \leqq k(e) k \leqq k(\varepsilon) pairwise distinct integers x_i with 1 \leqq x_i \leqq p^e, i = 1, ?, k 1 \leqq x_{i} \leqq p^{\varepsilon}, i = 1, \ldots, k , and such that¶¶?_i=1^k [1/(x_i)] o c    (mod p). \sum\limits_{i=1}^k {{1}\over{x_i}} \equiv c\quad (\mathrm{mod}\, p). ¶¶ This gives a positive answer to a question of Erdös and Graham.     

Maximal antiramsey graphs and the strong chromatic number

A typical problem arising in Ramsey graph theory is the following. For given graphs G and L, how few colors can be used to color the edges of G in order that no monochromatic subgraph isomorphic to L is formed? In this paper we investigate the opposite extreme. That is, we will require that in any subgraph of G isomorphic to L, all its edges have different colors. We call such a subgraph a totally multicolored copy of L. Of particular interest to us will be the determination of X_s(n, e, L), defined to be the minimum number of colors needed to edge-color some graph G(n, ?) with n vertices and e edges so that all copies of L in it are totally multicolored. It turns out that some of these questions are surprisingly deep, and are intimately related, for example, to the well-studied (but little understood) functions r_k(n), defined to be the size of the largest subset of {1, 2,…, n} containing no k-term arithmetic progression, and g(n; k, l), defined to be the maximum number of triples which can be formed from {1, 2,…, n} so that no two triples share a common pair, and no k elements of {1, 2,…, n} span l triples.     

On the derivatives of X-ray functions

We show that for every n \geqq 4, 0 \leqq k \leqq n - 3, p ? (0, 3] n \geqq 4, 0 \leqq k \leqq n - 3, p \in (0, 3] and every origin-symmetric convex body K in \mathbbRⁿ \mathbb{R}^n , the function ||x ||^-k₂ ||x ||^-n+k+p_K \parallel x \parallel^{-k}_{2} \parallel x \parallel^{-n+k+p}_{K} represents a positive definite distribution on \mathbbRⁿ \mathbb{R}^n , where ||·||₂ \parallel \cdot \parallel_{2} is the Euclidean norm and ||·||_K \parallel \cdot \parallel_{K} is the Minkowski functional of K. We apply this fact to prove a result of Busemann-Petty type that the inequalities for the derivatives of order (n - 4) at zero of X-ray functions of two convex bodies imply the inequalities for the volume of average m-dimensional sections of these bodies for all 3 \leqq m \leqq n 3 \leqq m \leqq n . We also prove a sharp lower estimate for the maximal derivative of X-ray functions of the order (n - 4) at zero.     

Sur les tours localement cyclotomiques

For a given number field K and any prime l\ell we construct an increasing sequence of l\ell -extensions K_n of K which are locally cyclotomic over K. We give various criterious of finiteness or non-finiteness of this l\ell -tower and we characterise the number fields which have such a finite tower in terms of Iwasawa theory.     

On q-Olivier Functions

We consider words w₁· · · w_n with letters w_i ? {1, 2, 3, ?} w_i \in \{1, 2, 3, \ldots\} satisfying an up-up-down pattern like a₁ h a₂ h a₃ S a₄ h a₅ h a₆ S · · · . Attaching the (geometric) probability pq^i-1 to the letter i (with p = 1 -- q), every word gets a probability by assuming independence of letters. We are interested in the probability that a random word of length n satisfies the up-up-down condition. It turns out that one has to consider the 3 residue classes (mod 3) separately; then one can compute the associated probability generating function. They turn out to be q-analogues of so called Olivier functions.     

On the Number of Edges in Colour-Critical Graphs and Hypergraphs

A (hyper)graph G is called k-critical if it has chromatic number k, but every proper sub(hyper)graph of it is (k-1)-colourable. We prove that for sufficiently large k, every k-critical triangle-free graph on n vertices has at least (k-o(k))n edges. Furthermore, we show that every (k+1)-critical hypergraph on n vertices and without graph edges has at least (k-3/³?{k}) n(k-3/\sqrt[3]{k}) n edges. Both bounds differ from the best possible bounds by o(kn) even for graphs or hypergraphs of arbitrary girth.     

A linear functional equation with a singularity at a fixed point

Summary. Local solutions of the functional equation¶¶z^k f( z) = ?_k=1ⁿG_k( z) f( s_kz ) +g( z) z{^\kappa} \phi \left( z\right) =\sum_{k=1}^nG_k\left( z\right) \phi \left( s_kz \right) +g\left( z\right) ¶with k > 0 \kappa > 0 and | s_k| \gt 1 \left| s_k\right| \gt 1 are considered. We prove that the equation is solvable if and only if a certain system of k \kappa conditions on G_k (k = 1, 2, ... , n) and g is fulfilled.     

Complete subgraphs with large degree sums

Let t(n, k) denote the Turán number—the maximum number of edges in a graph on n vertices that does not contain a complete graph K_k+1. It is shown that if G is a graph on n vertices with n ≥ k²(k – 1)/4 and m < t(n, k) edges, then G contains a complete subgraph K_k such that the sum of the degrees of the vertices is at least 2km/n. This result is sharp in an asymptotic sense in that the sum of the degrees of the vertices of K_k is not in general larger, and if the number of edges in G is at most t(n, k) – ? (for an appropriate ?), then the conclusion is not in general true. © 1992 John Wiley & Sons, Inc.     

Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs

An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that that every connected graph, except K ₂, is antimagic. Recently, using completely separating systems, Phanalasy et al. showed that for each k 3 2, q 3 \binomk+12{k\geq 2,\,q\geq\binom{k+1}{2}} with k|2q, there exists an antimagic k-regular graph with q edges and p = 2q/k vertices. In this paper we prove constructively that certain families of Cartesian products of regular graphs are antimagic.     

Odd order groups with the rewriting property Q3

Let n be an integer greater than 1, and let G be a group. A subset {x₁, x₂, ..., x_n} of n elements of G is said to be rewritable if there are distinct permutations p \pi and s \sigma of {1, 2, ..., n} such that¶¶x_p(1)x_p(2) ?x_p(n) = x_s(1)x_s(2) ?x_s(n). x_{\pi(1)}x_{\pi(2)} \ldots x_{\pi(n)} = x_{\sigma(1)}x_{\sigma(2)} \ldots x_{\sigma(n)}. ¶¶A group is said to have the rewriting property Q_n if every subset of n elements of the group is rewritable. In this paper we prove that a finite group of odd order has the property Q₃ if and only if its derived subgroup has order not exceeding 5.     

A note on a conjecture of Borwein and Choi

A polynomial P(X) with coefficients {ǃ} of odd degree N - 1 is cyclotomic if and only if¶¶P(X) = ±F_p1 (±X)F_p2(±X^p1) ?F_pr(±X^{p1 p2 ?p_r-1}) P(X) = \pm \Phi_{p1} (\pm X)\Phi_{p2}(\pm X^{p1}) \cdots \Phi_{p_r}(\pm X^{p1 p2 \cdots p_r-1}) ¶where N = p₁ p₂ · · · p_r and the p_i are primes, not necessarily distinct, and where F_p(X) : = (X^p - 1) / (X - 1) \Phi_{p}(X) := (X^{p} - 1) / (X - 1) is the p-th cyclotomic polynomial. This is a conjecture of Borwein and Choi [1]. We prove this conjecture for a class of polynomials of degree N - 1 = 2^r p^l - 1 N - 1 = 2^{r} p^{\ell} - 1 for any odd prime p and for integers r, l\geqq 1 r, \ell \geqq 1 .     

A Note on Large Rainbow Matchings in Edge-coloured Graphs

A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colours on the edges incident with a vertex over all vertices. Kostochka, Pfender, and Yancey showed that every edge-coloured graph on n vertices with minimum colour degree at least k contains a rainbow matching of size at least k, provided ${n\geq \frac{17}{4}k^2}$ . In this paper, we show that n ≥ 4k ? 4 is sufficient for k ≥ 4.     

Simple Explicit Formulas for the Frame-Stewart Numbers

Several different approaches to the multi-peg Tower of Hanoi problem are equivalent. One of them is Stewart's recursive formula ¶¶ S (n, p) = min {2S (n₁, p) + S (n-n₁, p-1) | n₁, n-n₁ ? \mathbbZ⁺}. S (n, p) = min \{2S (n_1, p) + S (n-n_1, p-1)\mid n_1, n-n_1 \in \mathbb{Z}^+\}. ¶¶In the present paper we significantly simplify the explicit calculation of the Frame-Stewart's numbers S(n, p) and give a short proof of the domain theorem that describes the set of all pairs (n, n₁), such that the above minima are achieved at n₁.     

The Theorem of the k-1 Happy Divorces

Given a binary relation R between the elements of two sets X and Y and a natural number k, it is shown that there exist k injective maps f₁, f₂,...,f_k: X \hookrightarrow Y X \hookrightarrow Y with # {f₁(x), f₂(x),...,f_k(x)}=k    and    (x,f₁(x)), (x, f₂(x)),...,(x, f_k(x)) ? R \# \{f_1(x), f_2(x),...,f_k(x)\}=k \quad{\rm and}\quad (x,f_1(x)), (x, f_2(x)),...,(x, f_k(x)) \in R for all x ? X x \in X if and only if the inequality k ·# A ￡ ?_{y ? Y} min(k, #{a ? A | (a,y) ? R}) k \cdot \# A \leq \sum_{y \in Y} min(k, \#\{a \in A \mid (a,y) \in R\}) holds for every finite subset A of X, provided {y ? Y | (x,y) ? R} \{y \in Y \mid (x,y) \in R\} is finite for all x ? X x \in X .¶Clearly, as suggested by this paper's title, this implies that, in the context of the celebrated Marriage Theorem, the elements x in X can (simultaneously) marry, get divorced, and remarry again a partner from their favourite list as recorded by R, for altogether k times whenever (a) the list of favoured partners is finite for every x ? X x \in X and (b) the above inequalities all hold.¶In the course of the argument, a straightforward common generalization of Bernstein's Theorem and the Marriage Theorem will also be presented while applications regarding (i) bases in infinite dimensional vector spaces and (ii) incidence relations in finite geometry (inspired by Conway's double sum proof of the de Bruijn-Erdös Theorem) will conclude the paper.     

An exact algorithm for subgraph homeomorphism

The subgraph homeomorphism problem is to decide if there is an injective mapping of the vertices of a pattern graph into vertices of a host graph so that the edges of the pattern graph can be mapped into (internally) vertex-disjoint paths in the host graph. The restriction of subgraph homeomorphism where an injective mapping of the vertices of the pattern graph into vertices of the host graph is already given in the input instance is termed fixed-vertex subgraph homeomorphism.We show that fixed-vertex subgraph homeomorphism for a pattern graph on p vertices and a host graph on n vertices can be solved in time 2^n−pn^O(1) or in time 3^n−pn^O(1) and polynomial space. In effect, we obtain new non-trivial upper bounds on the time complexity of the problem of finding k vertex-disjoint paths and general subgraph homeomorphism.     

Eigenvalues of Random Power law Graphs

Many graphs arising in various information networks exhibit the "power law" behavior -the number of vertices of degree k is proportional to k^-# for some positive #. We show that if # > 2.5, the largest eigenvalue of a random power law graph is almost surely(1+ o(1))?m (1+ o(1))\sqrt{m} where m is the maximum degree. Moreover, the klargest eigenvalues of a random power law graph with exponent # have power law distribution with exponent 2# if the maximum degree is sufficiently large, where k is a function depending on #, mand d, the average degree. When 2<#< 2.5, the largest eigenvalue is heavily concentrated at cm^3-# for some constant c depending on # and the average degree. This result follows from a more general theorem which shows that the largest eigenvalue of a random graph with a given expected degree sequence is determined by m, the maximum degree, and [(d)\tilde] \tilde{d} , the weighted average of the squares of the expected degrees. We show that the k-th largest eigenvalue is almost surely (1+ o(1))?{m_k} (1+ o(1))\sqrt{m_k} where m_k is the k-th largest expected degree provided m_k is large enough. These results have implications on the usage of spectral techniques in many areas related to pattern detection and information retrieval.