𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of Conformally Equivalent Maximal Graphs

✍ Scribed by Isabel Fernández

Book ID
107627553
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
485 KB
Volume
20
Category
Article
ISSN
1050-6926

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ Béla Bollobás; Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(

Maximal antiramsey graphs and the strong
Maximal antiramsey graphs and the strong chromatic number
✍ S. A. Burr; P. Erdös; R. L. Graham; V. T. Sós 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 916 KB

A typical problem arising in Ramsey graph theory is the following. For given graphs G and L, how few colors can be used to color the edges of G in order that no monochromatic subgraph isomorphic to L is formed? In this paper w e investigate the opposite extreme. That is, w e will require that in any

The number of maximal independent sets i
The number of maximal independent sets in connected graphs
✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,