Pages that link to "Item:Q1348665"

The following pages link to The Moore bound for irregular graphs (Q1348665):

Displaying 50 items.

• Counting trees in graphs (Q311564) (← links)
• Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
• Extremal edge polytopes (Q405274) (← links)
• Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
• Graphs with maximum size and lower bounded girth (Q427676) (← links)
• Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
• Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
• Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) (Q608265) (← links)
• New results on EX graphs (Q626971) (← links)
• Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
• Higher dimensional Moore bounds (Q659717) (← links)
• Girth and treewidth (Q707020) (← links)
• A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← links)
• New families of graphs without short cycles and large size (Q708348) (← links)
• Parity check matrices and product representations of squares (Q949791) (← links)
• Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
• The size of bipartite graphs with a given girth (Q1403918) (← links)
• 2-complexes with large 2-girth (Q1704898) (← links)
• Permutations resilient to deletions (Q1710995) (← links)
• The number of crossings in multigraphs with no empty lens (Q1725755) (← links)
• Simplicial girth and pure resolutions (Q1950400) (← links)
• Spectral threshold for extremal cyclic edge-connectivity (Q2053673) (← links)
• Planar Turán numbers on short cycles of consecutive lengths (Q2079819) (← links)
• Generalized Turán problems for even cycles (Q2200921) (← links)
• Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes (Q2224857) (← links)
• A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
• Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
• Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) (Q2341706) (← links)
• Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs (Q2346583) (← links)
• Improvement on the decay of crossing numbers (Q2376099) (← links)
• Spanners for bounded tree-length graphs (Q2383601) (← links)
• On the order of \((\{r,m\};g)\)-cages of even girth (Q2427507) (← links)
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs (Q2435574) (← links)
• On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
• An efficient algorithm for testing goal-minimality of graphs (Q2446346) (← links)
• On the Turán number for the hexagon (Q2497327) (← links)
• An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
• Diameter and connectivity of (<i>D; g</i>)-cages (Q3008349) (← links)
• The Zero Forcing Number of Graphs (Q4610449) (← links)
• On the Probability that a Random Subgraph Contains a Circuit (Q4978293) (← links)
• (Q5078597) (← links)
• The number of crossings in multigraphs with no empty lens (Q5084684) (← links)
• Geodesic Spanners for Points on a Polyhedral Terrain (Q5206937) (← links)
• (Q5212442) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• The non-backtracking spectrum of the universal cover of a graph (Q5247000) (← links)
• On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction (Q5323014) (← links)
• Improvement on the Decay of Crossing Numbers (Q5452206) (← links)
• The Price of Anarchy of a Network Creation Game with Exponential Payoff (Q5459986) (← links)
• Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)