✦ LIBER ✦

On the definability of properties of finite graphs

✍ Scribed by György Turán

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 555 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90166-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Defining a Relation on

The Complexity of Defining a Relation on a Finite Graph

✍ L. Babai; Gy. Turán 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 702 KB

On definability of types of finite Canto

On definability of types of finite Cantor-Bendixson rank

✍ Predrag Tanović 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## MSC (2010) 03C45 We prove that every type of finite Cantor-Bendixson rank over a model of a first-order theory without the strict order property is definable and has a unique nonforking extension to a global type.

On the Number of Slopes of the Graph of

On the Number of Slopes of the Graph of a Function Defined on a Finite Field

✍ A. Blokhuis; S. Ball; A.E. Brouwer; L. Storme; T. Szőnyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions.

On a property of fundamental groups of g

On a property of fundamental groups of graphs of finite groups

✍ P.H. Kropholler; Olympia Talelli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 277 KB

On Zeta Functions of Arithmetically Defi

On Zeta Functions of Arithmetically Defined Graphs

✍ Ortwin Scheja 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We study the graph X(n) that is de"ned as the "nite part of the quotient (n)!T, with T the Bruhat}Tits tree over % O ((1/¹ )) and (n) the principal congruence subgroup of "G¸(% We give concrete realizations of the ¸-functions of the "nite part of the hal#ine !T for "nite unitary representations of

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a