✦ LIBER ✦

A note concerning asymmetric games on graphs

✍ Scribed by Alvin E. Roth

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 195 KB
Volume: 25
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800250215

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.

📜 SIMILAR VOLUMES

A note concerning graphs with unique f-f

A note concerning graphs with unique f-factors

✍ Bill Jackson; R. W. Whitty 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

We show that if a 2-edge connected graph G has a unique f-factor F, then some vertex has the same degree in F as in G. This conclusion is the best possible, even if the hypothesis is considerably strengthened. 1. All graphs considered are finite but may contain loops and multiple edges. Let G be a

A note on conservative graphs

✍ Arthur T. White 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract An application of conservative graphs to topological graph theory is indicated.

A note on coset graphs

✍ Ulrike Baumann 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th

A note on Steiner tree games

✍ Darko Skorin-Kapov; Jadranka Skorin-Kapov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

A note on graphs spanned by Eulerian gra

A note on graphs spanned by Eulerian graphs

✍ W. R. Pulleyblank 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP‐complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at

A note on regular Ramsey graphs

✍ Noga Alon; Sonny Ben-Shimon; Michael Krivelevich 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We prove that there is an absolute constant __C__>0 so that for every natural __n__ there exists a triangle‐free __regular__ graph with no independent set of size at least \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle