# Graphs from Generalized Kac-Moody Algebras

@article{Terlep2012GraphsFG, title={Graphs from Generalized Kac-Moody Algebras}, author={T. Arthur Terlep and Jason S. Williford}, journal={SIAM J. Discret. Math.}, year={2012}, volume={26}, pages={1112-1120} }

In this paper, we construct new families of graphs whose automorphism groups are transitive on 3-paths. These graphs are constructed from certain Lie algebras related to generalized Kac--Moody algebras of rank two. We will show that one particular subfamily gives new lower bounds on the number of edges in extremal graphs with no cycles of length fourteen.

## 13 Citations

SOME FAMILIES OF GRAPHS , HYPERGRAPHS AND DIGRAPHS DEFINED BY SYSTEMS OF EQUATIONS : A SURVEY

- Mathematics
- 2016

The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s, and the only survey of these studies appeared in 2001. In this…

The trascendence of Kac-Moody algebras

- MathematicsFilomat
- 2021

With the main objective that it can be consulted by all researchers, mainly
young people, interested in the study of the Kac-Moody algebras and their
applications, this paper aims to present the…

On Some Cycles in Wenger Graphs

- Mathematics
- 2020

Let p be a prime, q be a power of p , and let F q be the field of q elements. For any positive integer n , the Wenger graph W n(q) is defined as follows: it is a bipartite graph with the vertex…

Michael Tait: Research Statement

- Mathematics
- 2017

My research uses algebraic and geometric methods to prove theorems in extremal combinatorics. Going the other way, I also use combinatorial methods to prove algebraic results. Algebraic methods are…

Supersaturated sparse graphs and hypergraphs

- Mathematics
- 2017

A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise…

Some tight lower bounds for Turán problems via constructions of multi-hypergraphs

- MathematicsEur. J. Comb.
- 2020

Turán numbers of theta graphs

- MathematicsCombinatorics, Probability and Computing
- 2020

It is shown that the largest graph not containing the theta graph has at most two vertices joined by t vertex-disjoint paths and that this is tight apart from the value of ${c_\ell }$ .

3-uniform hypergraphs with few Berge paths of length three between any two vertices

- Mathematics
- 2019

Recently, Berge theta hypergraphs have received special attention due to the similarity with Berge even cycles. Let $r$-uniform Berge theta hypergraph $\Theta_{\ell,t}^{B}$ be the $r$-uniform…

Diameter of Some Monomial Digraphs

- Mathematics
- 2018

Let $p$ be a prime, $e$ a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q^2\to\mathbb{F}_q$ be arbitrary functions, where $1\le…

Connectivity of some Algebraically Defined Digraphs

- MathematicsElectron. J. Comb.
- 2015

The strong connectivity of D is studied and completely describe its strong components, which are directed analogues of some algebraically defined graphs, which have been studied extensively and have many applications.

## References

SHOWING 1-10 OF 30 REFERENCES

Ramanujan graphs of very large girth based on octonions

- Mathematics
- 2010

We present a generalization of the construction of graphs by Lubotzky, Phillips and Sarnak in their celebrated article "Ramanujan graphs". The new approach consists in using octonion algebras rather…

Introduction to Lie Algebras and Representation Theory

- Mathematics
- 1973

Preface.- Basic Concepts.- Semisimple Lie Algebras.- Root Systems.- Isomorphism and Conjugacy Theorems.- Existence Theorem.- Representation Theory.- Chevalley Algebras and Groups.- References.-…

General Properties of Some Graphs Defined by Systems of Equations

- MathematicsElectron. Notes Discret. Math.
- 2000

Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size

- MathematicsDiscret. Appl. Math.
- 1995

New Examples of Graphs without Small Cycles and of Large Size

- MathematicsEur. J. Comb.
- 1993

A new infinite series of bipartite q-regular edge-transitive graphs of order 2q5 and girth 10 is constructed, motivated by some results on embeddings of Chevalley group geometries in the corresponding Lie algebras and a construction of a blow-up for an incident system and a graph.

On Arithmetic Progressions of Cycle Lengths in Graphs

- MathematicsCombinatorics, Probability and Computing
- 2000

This paper proves that, for k > 2, a bipartite graph of average degree at least 4k and girth g contains cycles of (g/2 − 1)k consecutive even lengths.

On generalizing generalized polygons

- Mathematics
- 2009

The purpose of this paper is to reveal in geometric terms a decade-old construction of certain families of graphs with nice extremal properties. Construction of the graphs in question is motivated by…

Ramanujan Graphs

- Mathematics
- 1965

In the last two decades, the theory of Ramanujan graphs has gained prominence primarily for two reasons. First, from a practical viewpoint, these graphs resolve an extremal problem in communication…