Minimal Regular Graphs of Girths Eight and Twelve
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On bipartite graphs of defect 2
- On a class of degenerate extremal graph problems
- Über Tuttes Cages
- Tables of large graphs with given degree and diameter
- Bipartite distance-regular graphs of valency three
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- A survey on graphs with polynomial growth
- Table of large \(({\Delta{}}, D)\)-graphs
- Über lokal s-reguläre Graphen
- Polarities and \(2k\)-cycle-free graphs
- Forbidden induced partial orders
- Large \(s\)-representable set systems with low maximum degree
- Automorphisms of graphs and coverings
- On subgraphs of \(C_{2k}\)-free graphs
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Bipartite algebraic graphs without quadrilaterals
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- On bipartite tetra0alent graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- On product representation of powers. I
- On the distortion required for embedding finite metric spaces into normed spaces
- Tight bounds for powers of Hamilton cycles in tournaments
- Generalized rainbow Turán problems
- Forbidding multiple copies of forestable graphs
- Generalized Turán problems for even cycles
- A construction of small \((q-1)\)-regular graphs of girth 8
- On cages admitting identifying codes
- On the order of \((\{r,m\};g)\)-cages of even girth
- On a conjecture of Erdős and Simonovits: even cycles
- On monomial graphs of girth eight
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Generalized multiplicative Sidon sets
- Small regular graphs of girth 7
- Multi-color Ramsey numbers of even cycles
- A geometric representation of certain generalized hexagons in PG(3,s)
- On a graph of Hoffman and Singleton
- A trivalent graph of girth ten
- On regular graphs. III
- Large planar subgraphs in dense graphs
- Bipartite Turán problems for ordered graphs
- Graphs without cycles of even length
- A family of graphs and the degree/diameter problem
- General properties of some families of graphs defined by systems of equations
- Maximizing the order of a regular graph of given valency and second eigenvalue
- A note on the Turán function of even cycles
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- The number of \(C_{2\ell}\)-free graphs
- Constructions of small regular bipartite graphs of girth 6
- On large ( , D, D, 1)-graphs
- On the order of bi-regular cages of even girth
- On extremal bipartite graphs with high girth
- Forbidden induced bipartite graphs
- On bipartite graphs of diameter 3 and defect 2
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Diameters and Eigenvalues
- Graphs with even girth and small excess
- Cages—a survey
- Extremal edge polytopes
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
- Optimal edge coloring of large graphs
- New large graphs with given degree and diameter six
- A new series of dense graphs of high girth
- Fractional products of sets
- Families of small regular graphs of girth 5
- A hierarchy of lower bounds for sublinear additive spanners
- Constructions of bipartite graphs from finite geometries
- On optimization problems for graphs and security of digital communications
- Minors in graphs of large girth
- New bounds on \(\bar{2}\)-separable codes of length 2
- Extremal numbers of cycles revisited
- Turán numbers of theta graphs
- Ramsey numbers for nontrivial Berge cycles
- On the automorphisms of a family of small q-regular graphs of girth 8
- Graphs with few paths of prescribed length between any two vertices
- Relative Turán problems for uniform hypergraphs
- On small world non-Sunada twins and cellular Voronoi diagrams
- Cycles in graphs of fixed girth with large size
- Some new large (Δ, 3)‐graphs
- An alternate description of a \((q + 1, 8)\)-cage
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- On large (Δ, 6)-Graphs
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Two new families of large compound graphs
- A randomized embedding algorithm for trees
- scientific article; zbMATH DE number 7651222 (Why is no real title available?)
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Balanced supersaturation for some degenerate hypergraphs
- Improved lower bounds for multiplicative square-free sequences
- On sparse parity check matrices (extended abstract)
- Extremal numbers of hypergraph suspensions of even cycles
- Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\)
- On the spectral radius of graphs with given maximum degree and girth
- Improved hardness of approximation of diameter in the CONGEST model
- Generalized Turán problems for even cycles
- A polynomial resultant approach to algebraic constructions of extremal graphs
- On the boundedness of degenerate hypergraphs
- Polycyclic geometric realizations of the Gray configuration
- Spectral polynomials, graph descriptors, spectra, and entropies of cage graphs
- Phase transition of degenerate Turán problems in p-norms
This page was built for publication: Minimal Regular Graphs of Girths Eight and Twelve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524327)
