Dynamic cage survey
From MaRDI portal
Summary: A \((k, g)\)-cage is a \(k\)-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions. Version 2 published: May 8, 2011 (54 pages) Version 3 published: July 26, 2013 (55 pages)
Recommendations
Cited in
(only showing first 100 items - show all)- A note on the problem of finding a (3,9)-cage
- On the defect of vertex-transitive graphs of given degree and diameter
- Edge-girth-regular graphs
- On the excess of vertex-transitive graphs of given degree and girth
- On the non-existence of antipodal cages of even girth
- Elliptic semiplanes and regular graphs with girth 5
- Rainbow connectivity of Moore cages of girth 6
- Online graph exploration: New results on old and new algorithms
- On superconnectivity of (4, g)-cages
- Bipartite biregular Moore graphs
- Largest 2-regular subgraphs in 3-regular graphs
- Codes for distributed storage from 3-regular graphs
- On diregular digraphs with degree two and excess three
- Spectra of orders for \(k\)-regular graphs of girth \(g\)
- Regular Turán numbers of complete bipartite graphs
- Extremal edge-girth-regular graphs
- On the distance spectrum of minimal cages and associated distance biregular graphs
- Mixed cages: monotonicity, connectivity and upper bounds
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
- On new record graphs close to bipartite Moore graphs
- On networks with order close to the Moore bound
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- On the packing chromatic number of Moore graphs
- A connection between a question of Bermond and Bollobás and Ramanujan graphs
- A new upper bound for the traveling salesman problem in cubic graphs
- Maximizing algebraic connectivity for certain families of graphs
- Graph-based convolutional and block LDPC codes
- On total regularity of mixed graphs with order close to the Moore bound
- Symmetry properties of generalized graph truncations
- Improving bounds on the order of regular graphs of girth 5
- Mixed cages
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six
- A construction of small \((q-1)\)-regular graphs of girth 8
- Generalized cages
- Wheel and star-critical Ramsey numbers for quadrilateral
- On a conjecture on the order of cages with a given girth pair
- New small regular graphs of girth 5
- Petrie duality and the Anstee-Robertson graph
- On biregular bipartite graphs of small excess
- On the girth of voltage graph lifts
- Small regular graphs of girth 7
- The locus of Brill-Noether general graphs is not dense
- Distances in graphs of girth 6 and generalised cages
- New values for the bipartite Ramsey number of the four-cycle versus stars
- Special structures in \(\mathcal{Q}(4, q)\), projective planes and its application in \(L(h, k)\)-colorings of their Moore graphs
- Small graphs and hypergraphs of given degree and girth
- A trivalent graph of girth 17
- Isolating highly connected induced subgraphs
- New results on connectivity of cages
- Constructions of small regular bipartite graphs of girth 6
- Small vertex-transitive and Cayley graphs of girth six and given degree: An algebraic approach
- Biregular cages of odd girth
- Cayley cages
- On bi-regular cages of even girth at least 8
- On the order of graphs with a given girth pair
- Fast generation of regular graphs and construction of cages
- scientific article; zbMATH DE number 1303556 (Why is no real title available?)
- scientific article; zbMATH DE number 1156668 (Why is no real title available?)
- Recursive constructions of small regular graphs of given degree and girth
- Families of small regular graphs of girth 5
- scientific article; zbMATH DE number 1750094 (Why is no real title available?)
- Fractional chromatic number, maximum degree, and girth
- On the automorphisms of a family of small q-regular graphs of girth 8
- New family of small regular graphs of girth 5
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- scientific article; zbMATH DE number 7109401 (Why is no real title available?)
- An alternate description of a \((q + 1, 8)\)-cage
- On bipartite cages of excess 4
- On some properties of cages
- Conjectures on cops and robbers
- Computational determination of (3,11) and (4,7) cages
- Perfect matchings in highly cyclically connected regular graphs
- Radius, girth and minimum degree
- Extremal absorbing sets in low-density parity-check codes
- On a relation between bipartite biregular cages, block designs and generalized polygons
- On girth-biregular graphs
- On decreasing the orders of (k,g)-graphs
- Using bi-coset graphs to construct small regular and biregular graphs
- Partial linear spaces and identifying codes
- Monotonicity of the order of \((D;g)\)-cages
- Extremal regular graphs and hypergraphs related to fractional repetition codes
- On the harmonious chromatic number of graphs
- On mixed cages
- Improved lower bound for differentially private facility location
- New graphs related to \((p,6)\) and \((p,8)\)-cages
- Flip colouring of graphs
- New results on bipartite biregular cages, block designs, and generalized polygons
- A family of arc-transitive graphs of girth at least 5 admitting a Suzuki simple group
- Spectral sparsification via bounded-independence sampling
- Weighted cages
- On links between G-graphs and lifts
- Polycyclic geometric realizations of the Gray configuration
- Minimum 2-percolating sets in 2-connected, diameter 2 graphs
- On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
- Two proofs of the existence of (k, g)-cages
- Theoretical and computational approaches to determining sets of orders for (k, g)-graphs
- Graphs and hypergraphs of prescribed girth and degrees with restricted cycles
- On (k,g)-graphs without (g + 1)-cycles
- All McKay-Miller-Širáň graphs are bi-Cayley
This page was built for publication: Dynamic cage survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378882)
