The Moore bound for irregular graphs
From MaRDI portal
Publication:1348665
DOI10.1007/S003730200002zbMath0990.05075OpenAlexW2058374373MaRDI QIDQ1348665
Nathan Linial, Shlomo Hoory, Noga Alon
Publication date: 14 May 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200002
Related Items (55)
Improvement on the decay of crossing numbers ⋮ Counting trees in graphs ⋮ Spanners for bounded tree-length graphs ⋮ Unnamed Item ⋮ On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction ⋮ Colorings of the \(d\)-regular infinite tree ⋮ Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ Parameterized complexity of \(k\)-Chinese postman problem ⋮ Extremal edge polytopes ⋮ A simple proof for the lower bound of the girth of graphs \(D(n,q)\) ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Extremal results on feedback arc sets in digraphs ⋮ New results on EX graphs ⋮ The size of bipartite graphs with a given girth ⋮ On the order of \((\{r,m\};g)\)-cages of even girth ⋮ Unnamed Item ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Graphs with maximum size and lower bounded girth ⋮ A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs ⋮ Generalized Turán problems for even cycles ⋮ 2-complexes with large 2-girth ⋮ Simplicial girth and pure resolutions ⋮ Edge-connectivity and (signless) Laplacian eigenvalue of graphs ⋮ Kernel bounds for disjoint cycles and disjoint paths ⋮ The Zero Forcing Number of Graphs ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Permutations resilient to deletions ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ An efficient algorithm for testing goal-minimality of graphs ⋮ The number of crossings in multigraphs with no empty lens ⋮ Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes ⋮ Higher dimensional Moore bounds ⋮ Diameter and connectivity of (D; g)-cages ⋮ Parity check matrices and product representations of squares ⋮ Unnamed Item ⋮ Girth and treewidth ⋮ A lower bound on the spectral radius of the universal cover of a graph ⋮ New families of graphs without short cycles and large size ⋮ On the Turán number for the hexagon ⋮ Geodesic Spanners for Points on a Polyhedral Terrain ⋮ A short proof for a lower bound on the zero forcing number ⋮ Improvement on the Decay of Crossing Numbers ⋮ The Price of Anarchy of a Network Creation Game with Exponential Payoff ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ An Entropy-Based Proof for the Moore Bound for Irregular Graphs ⋮ On the Probability that a Random Subgraph Contains a Circuit ⋮ The number of crossings in multigraphs with no empty lens ⋮ Minimum cuts, girth and a spectral threshold ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Planar Turán numbers on short cycles of consecutive lengths ⋮ The non-backtracking spectrum of the universal cover of a graph ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ Explicit Near-Ramanujan Graphs of Every Degree ⋮ Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) ⋮ Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
This page was built for publication: The Moore bound for irregular graphs
