General properties of some families of graphs defined by systems of equations

DOI10.1002/jgt.1024zbMath0990.05080OpenAlexW4246611826MaRDI QIDQ2757094

Andrew J. Woldar, Felix Lazebnik

Publication date: 21 November 2001

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1024

zbMATH Keywords

coveringRamsey numbersextremal problemscoloringsedge-decompositioninfinite families of graphsembedded spectra

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

A new family of algebraically defined graphs with small automorphism group ⋮ On the conjecture for the girth of the bipartite graph \(D(k,q)\) ⋮ Eigenvalues of Cayley graphs ⋮ Orthomorphisms and the construction of projective planes ⋮ Proof of a conjecture on monomial graphs ⋮ The eigenvalues of the graphs \(D(4,q)\) ⋮ Connectivity of some algebraically defined digraphs ⋮ On the girth of the bipartite graph \(D(k, q)\) ⋮ Girth of the algebraic bipartite graph \(D(k,q)\) ⋮ A simple proof for the lower bound of the girth of graphs \(D(n,q)\) ⋮ On the girth cycles of the bipartite graph \(D(k, q)\) ⋮ A Result on Polynomials Derived Via Graph Theory ⋮ On the eigenvalues of the graphs \(D(5,q)\) ⋮ On the connectivity of certain graphs of high girth. ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spectral and combinatorial properties of some algebraically defined graphs ⋮ On monomial graphs of girth eight ⋮ Multi-color Ramsey numbers of even cycles ⋮ On the diameter of Wenger graphs ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras ⋮ On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions ⋮ Linearized Wenger graphs ⋮ Density of balanced 3-partite graphs without 3-cycles or 4-cycles ⋮ On coupon colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On a class of degenerate extremal graph problems
• Ramanujan graphs
• Decompositions of regular bipartite graphs
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• On multicolor Ramsey numbers for complete bipartite graphs
• Polarities and \(2k\)-cycle-free graphs
• Properties of certain families of \(2k\)-cycle-free graphs
• New examples of graphs without small cycles and of large size
• New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles
• Graphs without quadrilaterals
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
• Explicit construction of graphs with an arbitrary large girth and of large size
• Graphs of prescribed girth and bi-degree
• On the number of edges of quadrilateral-free graphs
• A characterization of the components of the graphs \(D(k,q)\)
• A new series of dense graphs of high girth
• On the structure of extremal graphs of high girth
• Minimal Regular Graphs of Girths Eight and Twelve
• On Graphs that do not Contain a Thomsen Graph
• Regular Graphs with Given Girth and Restricted Circuits