scientific article; zbMATH DE number 3189017
From MaRDI portal
Publication:5725269
zbMath0116.15002MaRDI QIDQ5725269
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
High-girth near-Ramanujan graphs with localized eigenvectors ⋮ A note on small linear-ordering polytopes ⋮ On the jumping constant conjecture for multigraphs ⋮ Ramsey-nice families of graphs ⋮ Edge-girth-regular graphs ⋮ A simple construction of high representativity triangulations ⋮ A tight Erdős-Pósa function for long cycles ⋮ New small regular graphs of girth 5 ⋮ The limits of local search for weighted \(k\)-set packing ⋮ On networks with order close to the Moore bound ⋮ Cayley cages ⋮ Decoding turbo-like codes via linear programming ⋮ Short disjoint cycles in graphs with degree constraints ⋮ Strong edge-coloring of cubic bipartite graphs: a counterexample ⋮ High girth and extendability ⋮ Identifying defective sets using queries of small size ⋮ On bi-regular cages of even girth at least 8 ⋮ Relaxed two-coloring of cubic graphs ⋮ Online graph exploration: New results on old and new algorithms ⋮ On the order of graphs with a given girth pair ⋮ On regular hypergraphs of high girth ⋮ On biregular bipartite graphs of small excess ⋮ On the excess of vertex-transitive graphs of given degree and girth ⋮ Space lower bounds for low-stretch greedy embeddings ⋮ On superconnectivity of (\(4, g\))-cages ⋮ Low-distortion embeddings of graphs with large girth ⋮ Small bi-regular graphs of even girth ⋮ Graphs with prescribed degree sets and girth ⋮ On the order of \((\{r,m\};g)\)-cages of even girth ⋮ Partitioning into graphs with only small components ⋮ Generating \(r\)-regular graphs ⋮ Applications of integer programming methods to cages ⋮ Recursive constructions of small regular graphs of given degree and girth ⋮ Permutations resilient to deletions ⋮ Families of small regular graphs of girth 5 ⋮ Explicit constructions of graphs without short cycles and low density codes ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Monotonicity of the order of \((D;g)\)-cages ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Growth of the Weil-Petersson diameter of moduli space ⋮ Regular graphs of large girth and arbitrary degree ⋮ On the density of triangles and squares in regular finite and unimodular random graphs ⋮ Degree bipartite Ramsey numbers ⋮ On the non-existence of antipodal cages of even girth ⋮ New family of small regular graphs of girth 5 ⋮ On sparse spanners of weighted graphs ⋮ On the girth of infinite graphs ⋮ On bipartite cages of excess 4 ⋮ F-Continuous Graphs ⋮ Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages ⋮ On upper bounds of odd girth cages ⋮ Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ Un problème extremal pour les graphes et les hypergraphes ⋮ On the limitations of the use of solvable groups in Cayley graph cage constructions ⋮ A new bound for the connectivity of cages ⋮ On superconnectivity of (4,g)-cages with even girth ⋮ On regular induced subgraphs of generalized polygons ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ Improved lower bounds for the orders of even girth cages ⋮ On the girth of extremal graphs without shortest cycles ⋮ Results on F-continuous graphs ⋮ Forest embeddings in regular graphs of large girth ⋮ Tripartite graphs with given degree set ⋮ Small regular graphs of girth 7 ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ Spectra of orders for \(k\)-regular graphs of girth \(g\) ⋮ Net structure and cages ⋮ Constructions of small regular bipartite graphs of girth 6 ⋮ Every cubic cage is quasi 4-connected ⋮ Extremal edge-girth-regular graphs ⋮ Local search for the minimum label spanning tree problem with bounded color classes. ⋮ Constructions of bi-regular cages ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte ⋮ Edge-superconnectivity of semiregular cages with odd girth ⋮ Ein Extremalproblem des Zusammenhangs von Graphen ⋮ A smallest graph of girth 5 and valency 5 ⋮ Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth ⋮ Logarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\) ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected ⋮ Mixed cages ⋮ Explicit construction of regular graphs without small cycles ⋮ The number of cycle lengths in graphs of given minimum degree and girth ⋮ Comparison of mean distance in superposed networks ⋮ Systolic geometry of connected sums and cyclic covering. ⋮ Kissing numbers of regular graphs ⋮ Fragmentability of graphs ⋮ Hyperbolic surfaces with long systoles that form a pants decomposition ⋮ A construction of small \((q-1)\)-regular graphs of girth 8 ⋮ Generalized cages ⋮ Girths of bipartite sextet graphs ⋮ Information retrieval with unambiguous output ⋮ Systolic volume of homology classes ⋮ Light 3-stars in embedded graphs ⋮ Mixed cages: monotonicity, connectivity and upper bounds ⋮ On a conjecture on the order of cages with a given girth pair
This page was built for publication:
