Hall’s and Kőnig’s theorem in graphs and hypergraphs

We investigate the relation between Hall’s theorem and K?nig’s theorem in graphs and hypergraphs. In particular, we characterize the graphs satisfying a deficiency version of Hall’s theorem, thereby showing that this class strictly contains all K?nig–Egerváry graphs. Furthermore, we give a generalization of Hall’s theorem to normal hypergraphs.     

Menger’s theorem for infinite graphs

We prove that Menger’s theorem is valid for infinite graphs, in the following strong version: let A and B be two sets of vertices in a possibly infinite digraph. Then there exist a set of disjoint A–B paths, and a set S of vertices separating A from B, such that S consists of a choice of precisely one vertex from each path in . This settles an old conjecture of Erdős.     

Proof of Ding’s conjecture on maximal stable sets and maximal cliques in planar graphs

X. Deng et al. proved Chvātal＇s conjecture on maximal stable sets and maximal cliques in graphs. G. Ding made a conjecture to generalize Chvátal＇s conjecture. The purpose of this paper is to prove this conjecture in planar graphs and the complement of planar graphs.     

Generalizing Kruskal’s theorem to pairs of cohabitating trees

We investigate the extent to which structures consisting of sequences of forests on the same underlying set are well-quasi-ordered under embeddings.     

Wallace’s theorem and Miquel’s theorem in higher dimensions

We present a simple proof for the generalizations of a result due to Wallace and a result due to Miquel to higher dimensions.     

Transfer and Tate’s theorem

Let H be a subgroup of a finite group G, and assume that p is a prime that does not divide |G : H|. In favorable circumstances, one can use transfer theory to deduce that the largest abelian p-groups that occur as factor groups of G and of H are isomorphic. When this happens, Tate’s theorem guarantees that the largest not-necessarily-abelian p-groups that occur as factor groups of G and H are isomorphic. Known proofs of Tate’s theorem involve cohomology or character theory, but in this paper, a new elementary proof is given. It is also shown that the largest abelian p-factor group of G is always isomorphic to a direct factor of the largest abelian p-factor group of H. Received: 17 June 2008     

Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings

For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph’s list-chromatic number.     

Spectral decomposition and Gelfand’s theorem

We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set $\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\}We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set s(A)={il_k;k ? \mathbb\mathbbZ^*}\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\} is discrete and satisfies ?\frac1|l_k|^ld_kⁿ < ￥\sum \frac{1}{|\lambda_{k}|^{\ell}\delta_{k}^{n}}<\infty , where ℓ is a nonnegative integer and d_k=min(\frac|l_k+1-l_k|2,\frac|l_k-1-l_k|2)\delta _{k}=\min(\frac{|\lambda_{k+1}-\lambda _{k}|}{2},\frac{|\lambda _{k-1}-\lambda _{k}|}{2}) . In this case, Theorem 3, we show by using Gelfand’s Theorem that there exists a family of projectors (P_k)_{k ? \mathbb\mathbbZ^*}(P_{k})_{k\in\mathbb{\mathbb{Z}}^{*}} such that, for any x∈D(A ^n+ℓ ), the decomposition ∑P _k x=x holds.     

Poncelet’s theorem and billiard knots

Let D be any elliptic right cylinder. We prove that every type of knot can be realized as the trajectory of a ball in D. This proves a conjecture of Lamm and gives a new proof of a conjecture of Jones and Przytycki. We use Jacobi??s proof of Poncelet??s theorem by means of elliptic functions.     

Hindman’s theorem and idempotent types

Motivated by a question of Di Nasso, we show that Hindman’s theorem is equivalent to the existence of idempotent types in countable complete extensions of Peano Arithmetic.     

A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs

We give a generalization of Eagon-Reiner’s theorem relating Betti numbers of the Stanley-Reisner ideal of a simplicial complex and the CM_t property of its Alexander dual. Then we characterize bi-CM_t bipartite graphs and bi-CM_t chordal graphs. These are generalizations of recent results due to Herzog and Rahimi.     

Berkson’s theorem

We give a new proof of the theorem that Amitsur’s complex for purely inseparable field extensions has vanishing homology in dimensions higher than 2. This is accomplished by computing the kernel and cokernel of the logarithmic derivativet →Dt/t mapping the multiplicative Amitsur complex to the acyclic additive one (D is a derivation of the extension field). This research was supported by National Science Foundation grant NSF GP 1649.     

The degenerated second main theorem and Schmidt’s subspace theorem

In this paper, we establish a Second Main Theorem for an algebraically degenerate holomorphic curve f : C → Pn(C) intersecting hypersurfaces in general position. The related Diophantine problems are also considered.     

Picard’s theorem and the Rickman construction

Nevanlinna theory (value-distribution theory) has its genesis in Picard’s discovery that a function analytic in the plane which omits two values is constant. Nearly a century later, attention turned to the analogous situation in Rn, n≥3, where entire functions are necesarily replaced by entire quasiregular mappings. This expository article centers on one of Seppo Rickman’s main contributions to this issue, including an outline of his famous example showing that the omitted set in R3, while finite, can be much larger than possible in the plane.