Note on limits of finite graphs

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.     

A generalization of a theorem of Foxby

In this paper, it is proved that a commutative noetherian local ring admitting a finitely generated module of finite projective and injective dimensions with respect to a semidualizing module is Gorenstein. This result recovers a celebrated theorem of Foxby.      

A homological characterization of piecewise hereditary algebras

Let Λ be a finite dimensional algebra over a field k. We will show here that Λ is piecewise hereditary if and only if its strong global dimension is finite. Dedicated to Otto Kerner on the occasion of his 65th birthday. The second author is supported by a grant from NSA. These results were obtained during a visit of the first author at Syracuse University. He would like to thank the second author for the hospitality during his stay.     

Connected but not path-connected subspaces of infinite graphs

Solving a problem of Diestel [9] relevant to the theory of cycle spaces of infinite graphs, we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and path-connectedness to coincide for all but a few sets, which have a complicated structure.     

A note on a spanning 3-tree

A tree T is called a k-tree, if the maximum degree of T is at most k. In this paper, we prove that if G is an n-connected graph with independence number at most n + m + 1 (n≥1,n≥m≥0), then G has a spanning 3-tree T with at most m vertices of degree 3.     

On end degrees and infinite cycles in locally finite graphs

We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel and Kühn [4, 5], which allows for infinite cycles, we prove that the edge set of a locally finite graph G lies in C(G) if and only if every vertex and every end has even degree. In the same way we generalise to locally finite graphs the characterisation of the cycles in a finite graph as its 2-regular connected subgraphs.     

Holomorphic vector bundles on non-algebraic tori of dimension 2

We describe the Chern classes of holomorphic vector bundles on non-algebraic complex torus of dimension 2.     

Embeddings and Ramsey numbers of sparse <Emphasis Type="Italic">κ</Emphasis>-uniform hypergraphs

Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6,23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to κ-uniform hypergraphs for any integer κ ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for κ-uniform hypergraphs of bounded maximum degree into suitable κ-uniform ‘quasi-random’ hypergraphs.     

Contracting endomorphisms and Gorenstein modules

A finite module M over a noetherian local ring R is said to be Gorenstein if Extⁱ(k, M) = 0 for all i ≠ dim R. An endomorphism φ: R → R of rings is called contracting if for some i ≥ 1. Letting ^φR denote the R-module R with action induced by φ, we prove: A finite R-module M is Gorenstein if and only if Hom_R(^φR, M) ≅ M and Extⁱ_R(^φR, M) = 0 for 1 ≤ i ≤ depth R. Received: 7 December 2007     

Note making a <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-free graph bipartite

We show that every K ₄-free graph G with n vertices can be made bipartite by deleting at most n ²/9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n/3. This proves an old conjecture of P. Erdős. Research supported in part by NSF CAREER award DMS-0546523, NSF grant DMS-0355497, USA-Israeli BSF grant, and by an Alfred P. Sloan fellowship.     

Normalizers of p-subgroups in finite groups

In this paper we give a computational strategy for constructing the normalizer of a p-subgroup in a finite group. Received: 31 January 2008     

Regularity results for quasilinear elliptic equations in the Heisenberg group

We prove regularity results for solutions to a class of quasilinear elliptic equations in divergence form in the Heisenberg group . The model case is the non-degenerate p-Laplacean operator where , and p is not too far from 2.     

On $${\mathcal{F}}$$ -supplemented subgroups of finite groups

Let G be a finite group and a formation of finite groups. We say that a subgroup H of G is -supplemented in G if there exists a subgroup T of G such that G = TH and is contained in the -hypercenter of G/H _G . In this paper, we use -supplemented subgroups to study the structure of finite groups. A series of previously known results are unified and generalized. Research of the author is supported by a NNSF grant of China (Grant #10771180).     

Coloring even-faced graphs in the torus and the Klein bottle

We prove that a triangle-free graph drawn in the torus with all faces bounded by even walks is 3-colorable if and only if it has no subgraph isomorphic to the Cayley graph C(Z ₁₃; 1,5). We also prove that a non-bipartite quadrangulation of the Klein bottle is 3-colorable if and only if it has no non-contractible separating cycle of length at most four and no odd walk homotopic to a non-contractible two-sided simple closed curve. These results settle a conjecture of Thomassen and two conjectures of Archdeacon, Hutchinson, Nakamoto, Negami and Ota. Institute for Theoretical Computer Science is supported as project 1M0545 by the Ministry of Education of the Czech Republic. The author was visiting Georgia Institute of Technology as a Fulbright scholar in the academic year 2005/06. Partially supported by NSF Grants No. DMS-0200595 and DMS-0354742.     

On the measure of intersecting families,uniqueness and stability

Let t≥1 be an integer and let A be a family of subsets of {1,2,…,n} every two of which intersect in at least t elements. Identifying the sets with their characteristic vectors in {0,1} ⁿ we study the maximal measure of such a family under a non uniform product measure. We prove, for a certain range of parameters, that the t-intersecting families of maximal measure are the families of all sets containing t fixed elements, and that the extremal examples are not only unique, but also stable: any t-intersecting family that is close to attaining the maximal measure must in fact be close in structure to a genuine maximum family. This is stated precisely in Theorem 1.6. We deduce some similar results for the more classical case of Erdős-Ko-Rado type theorems where all the sets in the family are restricted to be of a fixed size. See Corollary 1.7. The main technique that we apply is spectral analysis of intersection matrices that encode the relevant combinatorial information concerning intersecting families. An interesting twist is that part of the linear algebra involved is done over certain polynomial rings and not in the traditional setting over the reals. A crucial tool that we use is a recent result of Kindler and Safra [22] concerning Boolean functions whose Fourier transforms are concentrated on small sets. Research supported in part by the Israel Science Foundation, grant no. 0329745.     

A new family of maximal curves over a finite field

It has been known for a long time that the Deligne–Lusztig curves associated to the algebraic groups of type and defined over the finite field all have the maximum number of -rational points allowed by the Weil “explicit formulas”, and that these curves are -maximal curves over infinitely many algebraic extensions of . Serre showed that an -rational curve which is -covered by an -maximal curve is also -maximal. This has posed the problem of the existence of -maximal curves other than the Deligne–Lusztig curves and their -subcovers, see for instance Garcia (On curves with many rational points over finite fields. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 152–163. Springer, Berlin, 2002) and Garcia and Stichtenoth (A maximal curve which is not a Galois subcover of the Hermitan curve. Bull. Braz. Math. Soc. (N.S.) 37, 139–152, 2006). In this paper, a positive answer to this problem is obtained. For every q = n ³ with n = p ^r  > 2, p ≥ 2 prime, we give a simple, explicit construction of an -maximal curve that is not -covered by any -maximal Deligne–Lusztig curve. Furthermore, the -automorphism group Aut has size n ³(n ³ + 1)(n ² − 1)(n ² − n + 1). Interestingly, has a very large -automorphism group with respect to its genus . Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni, PRIN 2006–2007.     

Trifactorized locally finite groups with min-p for every prime p

A group G is trifactorized if G = AB = AC = BC with three subgroups A, B and C of G. Some structural theorems about trifactorized locally finite groups with minimum condition on p-subgroups for every prime p are proved. For instance, it is shown that G is locally supersoluble (locally nilpotent) if A and B are locally nilpotent and C is locally supersoluble (locally nilpotent). The second and the third author wish to thank the Institute of Mathematics of the University of Mainz for their excellent hospitality during the preparation of this paper. The second author is grateful to the University of Stellenbosch, South Africa, and the third author to the Deutsche Forschungsgemeinschaft (DFG) for financial assistance.     

An exact Turán result for the generalized triangle

Let Σ _k consist of all k-graphs with three edges D ₁, D ₂, D ₃ such that |D ₁ ∩ D ₂| = k − 1 and D ₁ Δ D ₂ ⊆ D ₃. The exact value of the Turán function ex(n, Σ _k ) was computed for k = 3 by Bollobás [Discrete Math. 8 (1974), 21–24] and for k = 4 by Sidorenko [Math Notes 41 (1987), 247–259]. Let the k-graph T _k ∈ Σ _k have edges

Quasi-randomness and the distribution of copies of a fixed graph

We show that if a graph G has the property that all subsets of vertices of size n/4 contain the “correct” number of triangles one would expect to find in a random graph G(n, 1/2), then G behaves like a random graph, that is, it is quasi-random in the sense of Chung, Graham, and Wilson [6]. This answers positively an open problem of Simonovits and Sós [10], who showed that in order to deduce that G is quasi-random one needs to assume that all sets of vertices have the correct number of triangles. A similar improvement of [10] is also obtained for any fixed graph other than the triangle, and for any edge density other than 1/2. The proof relies on a theorem of Gottlieb [7] in algebraic combinatorics, concerning the rank of set inclusion matrices.