# Browse by Subject "Mathematics"

• (1994)
If X is a class of groups, the class of counter-X groups is defined to consist of all groups having no non-trivial X-quotients. Counter-counter-finite groups are studied here; any non-trivial quotient of such a group has ...

application/pdf

PDF (2MB)
• (1963)

application/pdf

PDF (15MB)
• (1967)

application/pdf

PDF (3MB)
• (1964)

application/pdf

PDF (7MB)
• (1990)
Given a semisimple linear algebraic group G over an algebraically closed field K, we fix a Borel subgroup B and a maximal torus T. This determines a root system $\Phi$, and a set of simple roots $\Delta$. The subgroups ...

application/pdf

PDF (2MB)
• (1981)
This thesis presents a classification up to topological equivalence of those flows on the torus satisfying: (1) all singular points and closed orbits are hyperbolic; and (2) there are no saddle connections. Such flows are ...

application/pdf

PDF (2MB)
• (1972)

application/pdf

PDF (2MB)
• (2014-05)
A claw is a small graph--three edges, all sharing a common point, and nothing else.The graph pictured is claw induced saturated. It contains no claw, but claws are lurking everywhere: adding or deleting any edge will create ...

application/pdf

PDF (475kB)
• (1976)

application/pdf

PDF (980kB)
• (1970)

application/pdf

PDF (6MB)
• (1970)

application/pdf

PDF (1MB)
• (1971)

application/pdf

PDF (1MB)
• (1974)

application/pdf

PDF (3MB)
• (2006)
The second main result identifies Gromov-Hausdorff limits of certain sequences of manifolds-with-boundary as Alexandrov spaces of curvature bounded below.

application/pdf

PDF (2MB)
• (2007)
A labeling of a graph is a bijective function from the set {1,2,...,|E|} onto the edges of the graph. The sum of the labels on edges incident to a vertex v is the vertex-sum at v. A labeling is antimagic if the vertex-sums ...

application/pdf

PDF (3MB)
• (2004)
Then, we consider packing problems for d-degenerate graphs. Two graphs G1 and G 2 pack if G1 is a subgraph of the complement G¯2 of G 2. We disprove one of the conjecture of Bollobas and Eldridge and prove an extension of ...

application/pdf

PDF (6MB)
• (2004)
We also show that lambda(G) = q 2 + q = Delta2 - Delta for the incidence graph G of the projective plane PG (2, q). To prove this result, we convert the problem to a problem of packing of bipartite graphs into a complete ...

application/pdf

PDF (3MB)
• (2001)
An r-edge-coloring of Kn is (r, m)-splittable if V (Kn) can then be r-colored to avoid totally monochromatic m-cliques (introduced by Erdo&huml;s and Gyarfas. We interpret such colorings using a two-round game against an ...

application/pdf

PDF (5MB)
• (1994)
Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.

application/pdf

PDF (2MB)
• (1992)
An attempt is made to study the mathematical strength of the weak second order theories of Bounded Arithmetic U$\sbsp{2}{i}$ and V$\sbsp{2}{i}$, i $\geq$ 0, introduced by S. Buss. It is first shown that U$\sbsp{2}{1}$ can ...

application/pdf

PDF (3MB)