✦ LIBER ✦

On the homogeneous algebraic graphs of large girth and their applications

✍ Scribed by T. Shaska; V. Ustimenko

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 179 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.08.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the bipartite density of regular grap

On the bipartite density of regular graphs with large girth

✍ Ondřej Zýka 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__‖__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k → ∞~ __b~k~__ ≥ 6/7.

The circular chromatic number of series-

The circular chromatic number of series-parallel graphs with large girth

✍ Chien, Chihyun; Zhu, Xuding 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 2 views

It was proved by Hell and Zhu that, if G is a series-parallel graph of girth at least 2 (3k -1)/2 , then χ c (G) ≤ 4k/(2k -1). In this article, we prove that the girth requirement is sharp, i.e., for any k ≥ 2, there is a series-parallel graph G of girth 2 (3k -1)/2 -1 such that χ c (G) > 4k/(2k -1)

On eigenvalue multiplicity and the girth

On eigenvalue multiplicity and the girth of a graph

✍ P. Rowlinson 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On the girth of hamiltonian weakly pancy

On the girth of hamiltonian weakly pancyclic graphs

✍ Bollob�s, B�la; Thomason, Andrew 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of Erdős, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of

On the smallest graphs of girth 10 and v

On the smallest graphs of girth 10 and valency 3

✍ P.K. Wong 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Recently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,lO)-cage) must have 70 vertices. There are three non-isomorphic (3,10)-cages which have been known for some while. In this papel, it is shown that these are the only three possible (3,lO)-cages. Some of the p

On the structure of extremal graphs of h

On the structure of extremal graphs of high girth

✍ Lazebnik, Felix; Wang, Ping 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

Let n ≥ 3 be a positive integer, and let G be a simple graph of order v containing no cycles of length smaller than n + 1 and having the greatest possible number of edges (an extremal graph). Does G contain an n + 1-cycle? In this paper we establish some properties of extremal graphs and present sev