𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimizing the ∀-≩ degree of a connective-free formula

✍ Scribed by Jan Van den Bussche

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
728 KB
Volume
30
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on the number of vertices of de
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
✍ Mao-cheng Cai 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v

The number of vertices of degree k in a
The number of vertices of degree k in a minimally k-edge-connected digraph
✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdös is Eigh

On the Minimal Degree of a Primitive Per
On the Minimal Degree of a Primitive Permutation Group
✍ Robert Guralnick; Kay Magaard 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We improve a result of Liebeck and Saxl concerning the minimal degree of a primitive permutation group and use it to strengthen a result of Guralnick and Neubauer on generic covers of Riemann surfaces.