✦ LIBER ✦

On euler's partition of forms into genera

✍ Scribed by A.A. Antropov

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 214 KB
Volume: 22
Category: Article
ISSN: 0315-0860
DOI: 10.1006/hmat.1995.1018

No coin nor oath required. For personal study only.

✦ Synopsis

Euler was the first to use partitions of forms into genera in his studies on the law of quadratic reciprocity.

📜 SIMILAR VOLUMES

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

On partitioning the edges of graphs into

On partitioning the edges of graphs into connected subgraphs

✍ M. Jünger; G. Reinelt; W. R. Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

On the decomposition of Kn into complete

On the decomposition of Kn into complete m-partite graphs

✍ Qingxue Huang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract Graham and Pollak [3] proved that __n__ −1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show

The effects of concentration on partitio

The effects of concentration on partitioning of flexible chains into pores

✍ Tomas Bleha; Peter Cifra; Frank E. Karasz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 700 KB

On partitions of the q-ary Hamming space

On partitions of the q-ary Hamming space into few spheres

✍ Andreas Klein; Markus Wessler 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract In this paper, we present a generalization of a result due to Hollmann, Körner, and Litsyn [9]. They prove that each partition of the __n__‐dimensional binary Hamming space into spheres consists of either one or two or at least __n__ + 2 spheres. We prove a __q__‐ary version of that gap

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized