Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

The Domination Parameters of Cubic Graphs

Let ir(G), (G), i(G), ₀(G), (G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any nonnegative integers k₁, k₂, k₃, k₄, k₅ there exists a cubic graph G satisfying the following conditions: (G) – ir(G) k₁, i(G) – (G) k₂, ₀(G) – i(G) > k₃, (G) – ₀(G) – k₄, and IR(G) – (G) – k₅. This result settles a problem posed in [9].Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093).Supported by RUTCOR.     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

A solution to one of Kano's conjectures concerningk-th maximal spanning trees

Let (G) be the collection of all spanning trees of a connected and weighted graphG, andF ₁,F ₂, ...,F _m the partition of (G) such thatF _n the set ofi-th maximal spanning trees ofG. Kano^[1] conjectured that for anyA F ₁ and every integerk, 1km, there existsT F _k such that |T/A|k–1. This paper gives the conjecture a very simple proof, and related results.     

Indices of Maximal Subgroups of Finite Soluble Groups

We look at the structure of a soluble group G depending on the value of a function m(G)= max m _p G), where m _p(G)=max{log_p|G:M| | M< G, |G:M|=p ^a}, p (G). Theorem 1 states that for a soluble group G, (1) r(G/ (G))= m(G); (2) d(G/ (G)) 1+ (m(G)) 3+m(G); (3) l _p(G) 1+t, where 2^t-1<m _p(G) 2^t. Here, (G) is the Frattini subgroup of G, and r(G), d(G), and l _p(G) are, respectively, the principal rank, the derived length, and the p-length of G. The maximum of derived lengths of completely reducible soluble subgroups of a general linear group GL(n,F) of degree n, where F is a field, is denoted by (n). The function m(G) allows us to establish the existence of a new class of conjugate subgroups in soluble groups. Namely, Theorem 2 maintains that for any natural k, every soluble group G contains a subgroup K possessing the following properties: (1) m(K); k; (2) if T and H are subgroups of G such that K T <_max <_max H G then |H:T|=p ^t for some prime p and for t>k. Moreover, every two subgroups of G enjoying (1) and (2) are mutually conjugate.     

Quasi-symmetric 3-designs with triangle-free graph

The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0x<y<k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, ) where v=(+2)(²+4+2)+1, k=²+3+2 and =1,2,..., or D is a complement of one of these designs.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

Note on weakly mixing transformations

Summary LetT be a weakly mixing transformation with respect to a probability measureP on a metric space (X, d). Suppose further that every open ball of (X, d) has positive measure. Then we show that, for anyP-measurable setA withP(A) > 0, lim supD _k (T ⁿ A) =D _k (X) fork = 2, 3,, whereD _k (B) is the geometric diameter of orderk of a subsetB ofX. It is shown further that D _k can be replaced by essD _k , in the case whenTB is measurable wheneverB is measurable. These results complement a previous one due to R. E. Rice for strongly mixing transformations and improve a result of C. Sempi on weakly mixing transformations.     

Covering abelian groups with cyclic subsets

Summary Letk andm be positive integers. An abelian groupG is said to have ann-cover if there is a subsetS ofG consisting ofn elements such that every non-zero element ofG can be expressed in the formig for some elementg inS and integeri, 1 i k. Lets _n (k) be the largest order of abelian groups that have ann-cover. We investigate the behavior ofs _n (k)/k ask andn is fixed.     

On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function

Summary We study a class of generalized gamma functions _k (z) which relate to the generalized Euler constants _k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for _k is derived, and the constant term in the asymptotic expansion for log _k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.     

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let (t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let (t,n) be the minimum ofc(G), whereG ranges over allt-tough 2-connected graphs onn vertices. It is shown that for fixedt>0 there exist constantsA, B such that (t,n)A·log(n) and (t,n)·log((t,n))B·log(n). Examples are presented showing that fort1 there exist constantsA, B such that (t,n)A·log(n) and (t,n)B· log(n). It is conjectured that (t,n) B·log(n) for some constantB. This conjecture is shown to be valid within the class of 3-connected graphs and, as conjectured in Bondy [1] forl=3, within the class of 2-connectedK _1.l-free graphs, wherel is fixed.     

A property of nonlinear elliptic equations when the right-hand side is a measure

LetA(u)=–diva(x, u, Du) be a Leray-Lions operator defined onW ₀ ^1,p () and be a bounded Radon measure. For anyu SOLA (Solution Obtained as Limit of Approximations) ofA(u)= in ,u=0 on , we prove that the truncationsT _k(u) at heightk satisfyA(T _k(u)) A(u) in the weak * topology of measures whenk + .

---

Résumé SoitA(u)=–diva(x, u, Du) un opérateur de Leray-Lions défini surW ₀ ^1,p () et une mesure de Radon bornée. Pour toutu SOLA (Solution Obtenue comme Limite d'Approximations) deA(u)= dans ,u=0 sur , nous démontrons que les troncaturesT _k(u) à la hauteurk vérifientA(T _k(u)) A(u) dans la topologie faible * des mesures quandk + .

     

Packing circuits in eulerian digraphs

LetG be an eulerian digraph; let (G) be the maximum number of pairwise edge-disjoint directed circuits ofG, and (G) the smallest size of a set of edges that meets all directed circuits ofG. Borobia, Nutov and Penn showed that (G) need not be equal to (G). We show that (G)=(G) provided thatG has a linkless embedding in 3-space, or equivalently, if no minor ofG can be converted toK ₆ by –Y andY– operations.     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Legitimate colorings of projective planes

For a projective plane _n of ordern, let( _n ) denote the minimum numberk, so that there is a coloring of the points of _n ink colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently largen, 5 ( _n ) 8 for every projective plane _n of ordern. Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation     

Paradoxical subsets of hyperbolic and spherical discs

Given a disc D of radius r in H ² (resp. S ²) with <r (resp. <r), we determine the pairs (m,n) for which there is an (m,n)-paradoxical subset of D but not an (m–1, n)-paradoxical subset of D or an (m, n–1)-paradoxical subset of D.     

Sample path behaviour in connection with generalized arcsine laws

Summary LetG=(G(t),t0) be the process of last passage times at some fixed point of a Markov process. The Dynkin-Lamperti theorem provides a necessary and sufficient condition forG(t)/t to converge in law ast to some non-degenerate limit (which is then a generalized arcsine law). Under this condition, we give a simple integral test that characterizes the lower-functions ofG. We obtain a similar result forA ⁺=(A ⁺ (t),t0), the time spent in [0, ) by a real-valued diffusion process, in connection with Watanabe's recent extension of Lévy's second arcsine law.