๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Note on the geometrical construction of certain polygons

โœ Scribed by C. H. Chepmell

Publisher
Springer
Year
1912
Tongue
English
Weight
306 KB
Volume
71
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the construction of certain BI
A note on the construction of certain BIB designs
โœ R.N. Mohan ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 186 KB

In this note a method of construction of certain combinatorial designs is defined. This gives the solution of (121, 132, 60, 55, 27) which is marked as unknown by Kageyama [l].

A note on the girth-doubling constructio
A note on the girth-doubling construction for polygonal graphs
โœ รkos Seress; Eric Swartz ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 111 KB ๐Ÿ‘ 1 views

A near-polygonal graph is a graph which has a set C of m-cycles for some positive integer m such that each 2-path of is contained in exactly one cycle in C. If m is the girth of then the graph is called polygonal. Given a polygonal graph of valency r and girth m, Archdeacon and Perkel proved the exi

Note: A geometrical method of solving ce
Note: A geometrical method of solving certain games
โœ J. V. Howard ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB

One of the diagrammatic methods for solving two-person 2 x n matrix games can be extended to solve m x n games where each column of the matrix is a concave function of the row number. This gives a simple proof of a theorem of Benjamin and Goldman that such games have solutions involving no more than