Related papers: Reals n-generic relative to some perfect tree

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

We show that an inner model of a class-generic extension of L need not itself be such an extension. Our example is of the form L[R], where R is a real belonging to a class-generic extension of L and constructible from 0#.

We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any trees such that $T_i$ has $i$ vertices and maximum degree at most $cn/\log n$, then $\{T_1,\dots,T_n\}$ packs into $K_n$. Our main result…

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…

For any positive integer $r$ and real number $\alpha>1$, let ${\mathscr L}_r(\alpha)$ denote the set of positive real numbers defined recursively: $\alpha-1\in {\mathscr L}_r(\alpha)$, and for any multi-subset $\{q_1,q_2,\dots,q_s\}$ of…

A tree-based network on a set $X$ of $n$ leaves is said to be universal if any rooted binary phylogenetic tree on $X$ can be its base tree. Francis and Steel showed that there is a universal tree-based network on $X$ in the case of $n=3$,…

This paper extends the Pythagorean Theorem to positive and negative real exponents to take the form a^n + b^n = c^n and makes use of the definition gamma = b/a >= 1. For the case of n in the set of positive real numbers, n greater than or…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

For every $n\in \mathbb{N}$, we present a set $S_n$ of $O(n^{3/2}\log n)$ points in the plane such that every planar 3-tree with $n$ vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of $S_n$.…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real…

Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. Suppose that X is infinite, connected and of bounded degree. A first-order sentence in the language of X is almost surely true…

The generalized Tur\'{a}n number $ex(n,K_s,H)$ is defined to be the maximum number of copies of a complete graph $K_s$ in any $H$-free graph on $n$ vertices. Let $F$ be a linear forest consisting of $k$ paths of orders…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…