Mantel's theorem for random graphs

For a graph G, denote by t(G) (resp. b(G)) the maximum size of a triangle‐free (resp. bipartite) subgraph of G. Of course for any G, and a classic result of Mantel from 1907 (the first case of Turán's Theorem) says that equality holds for complete graphs. A natural question, first considered by Babai, Simonovits and Spencer about 20 years ago is, when (i.e., for what p = p(n)) is the “Erd?s‐Rényi” random graph G = G(n,p) likely to satisfy t(G) = b(G)? We show that this is true if for a suitable constant C, which is best possible up to the value of C. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 59–72, 2015     

An approximate,multivariable version of Specht's theorem

In this article we provide generalizations of Specht's theorem which states that two n × n matrices A and B are unitarily equivalent if and only if all traces of words in two non-commuting variables applied to the pairs (A, A?) and (B, B?) coincide. First, we obtain conditions which allow us to extend this to simultaneous similarity or unitary equivalence of families of operators, and secondly, we show that it suffices to consider a more restricted family of functions when comparing traces. Our results do not require the traces of words in (A, A?) and (B, B?) to coincide, but only to be close.     

The classical version of Stokes' theorem revisited

Using only fairly simple and elementary considerations–essentially from first year undergraduate mathematics–we show how the classical Stokes' theorem for any given surface and vector field in ?³ follows from an application of Gauss' divergence theorem to a suitable modification of the vector field in a tubular shell around the given surface. The two stated classical theorems are (like the fundamental theorem of calculus) nothing but shadows of the general version of Stokes' theorem for differential forms on manifolds. However, the main point in the present article is first, that this latter fact usually does not get within reach for students in first year calculus courses and second, that calculus textbooks in general only just hint at the correspondence alluded to above. Our proof that Stokes' theorem follows from Gauss' divergence theorem goes via a well-known and often used exercise, which simply relates the concepts of divergence and curl on the local differential level. The rest of this article uses only integration in 1, 2 and 3 variables together with a ‘fattening’ technique for surfaces and the inverse function theorem.     

A nonstandard proof of the spectral theorem for unbounded self-adjoint operators

We generalize Moore’s nonstandard proof of the Spectral theorem for bounded self-adjoint operators to the case of unbounded operators. The key step is to use a definition of the nonstandard hull of an internally bounded self-adjoint operator due to Raab.     

A new version of a theorem of Kaplansky

Abstract

A well-known theorem of Kaplansky states that any projective module is a direct sum of countably generated modules. In this paper, we prove the w-version of this theorem, where w is a hereditary torsion theory for modules over a commutative ring.

Communicated by Silvana Bazzoni     

A handy proof of Gay's theorem

In 1979, Gay proved that Broyden's methods, when used for n‐square linear systems, terminate in at most 2n iterations (SIAM J. Numer. Anal. 1979; 16 :623–630). Also, the ABS methods were introduced in 1984 (Numer. Math. 1984; 45 :1361–1376). In this paper we show another (handy) proof of Gay's theorem by these algorithms. Copyright © 2008 John Wiley & Sons, Ltd.     

A precolouring extension of Vizing's theorem

Fix a palette of colors, a graph with maximum degree , and a subset of the edge set with minimum distance between edges at least . If the edges of are arbitrarily precoloured from , then there is guaranteed to be a proper edge-coloring using only colors from that extends the precolouring on to the entire graph. This result is a first general precolouring extension form of Vizing's theorem, and it proves a conjecture of Albertson and Moore under a slightly stronger distance requirement. We also show that the condition on the distance can be lowered to when the graph contains no cycle of length .     

Hall's theorem for hypergraphs

We prove a hypergraph version of Hall's theorem. The proof is topological. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 83–88, 2000     

On a Conjecture of Erdős,Gallai, and Tuza

Erd?s, Gallai, and Tuza posed the following problem: given an n‐vertex graph G, let denote the smallest size of a set of edges whose deletion makes G triangle‐free, and let denote the largest size of a set of edges containing at most one edge from each triangle of G. Is it always the case that ? We have two main results. We first obtain the upper bound , as a partial result toward the Erd?s–Gallai–Tuza conjecture. We also show that always , where m is the number of edges in G; this bound is sharp in several notable cases.     

Tutte's spring theorem

We present a short proof of the theorem of Tutte that every planar 3‐connected graph has a drawing in the plane such that every vertex which is not on the outer cycle is the barycenter of its neighbors. Moreover, this holds for any prescribed representation of the outer cycle. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 275–280, 2004     

A version of Rolle's theorem and applications

This paper deals with global injectivity of vector fields defined on euclidean spaces. Our main result establishes a version of Rolle's Theorem under generalized Palais-Smale conditions. As a consequence of this, we prove global injectivity for a class of vector fields defined on n-dimensional spaces.Research partially supported by CNPq/Brazil under grant # 307014/89-4Research partially supported by CNPq/Brazil under grant # 301251/78-9     

A version of Brauer’s theorem for integer central functions

In this article we prove an effective version of the classical Brauer’s Theorem for integer class functions on finite groups.      

A refined Gallai-Edmonds structure theorem for weighted matching polynomials

In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this is related to a modification by Sylvester of the classical Sturm's theorem on the number of zeros of a real polynomial in an interval. In addition, we obtain some other results about zeros of matching polynomials.     

A Schauder-type fixed point theorem

In this brief note we study Schauder's second fixed point theorem in the space $(\mathit{BC},6\cdot 6)$ of bounded continuous functions $\varphi :[0,\infty )\to {\Re }^n$ with a view to reducing the requirement that there is a compact map to the requirement that the map is locally equicontinuous. Several examples are given, both motivating and applying the theory.     

A max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n × n nonnegative matrices in max algebra. In this paper we propose the notions of the max algebra version of the generalized spectral radius μ(Ψ) of Ψ, and the max algebra version of the joint spectral radius η(Ψ) of Ψ. The max algebra version of the generalized spectral radius theorem μ(Ψ) = η(Ψ) is established. We propose the relationship between the generalized spectral radius ρ(Ψ) of Ψ (in the sense of Daubechies and Lagarias) and its max algebra version μ(Ψ). Moreover, a generalization of Elsner and van den Driessche’s lemma is presented as well.     

Dirac's theorem for random graphs

A classical theorem of Dirac from 1952 asserts that every graph on n vertices with minimum degree at least \begin{align*}\left\lceil n/2 \right\rceil\end{align*} is Hamiltonian. In this paper we extend this result to random graphs. Motivated by the study of resilience of random graph properties we prove that if p ? log n/n, then a.a.s. every subgraph of G(n,p) with minimum degree at least (1/2 + o (1) )np is Hamiltonian. Our result improves on previously known bounds, and answers an open problem of Sudakov and Vu. Both, the range of edge probability p and the value of the constant 1/2 are asymptotically best possible. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012