Counting cycles and finite dimensional L^p norms

DOI10.1016/S0196-8858(02)00037-4MaRDI QIDQ1867019zbMATH OpenFDO

Authors Igor Rivin

Publication date 2 April 2003

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0111106

zbMATH Keywords

\(L^p\) normscyclesgraph spectra

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th powers of the coordinates and the Lk norm subject to the constraints that the sum of squares of the coordinates is fixed, and that the sum of the coordinates vanishes.

Recommendations

• Cyclicity in Dirichlet Spaces
• Locally finite cycles of linear mappings in countable dimension
• On cyclicity in weighted Dirichlet spaces
• Cyclicity in Dirichlet type spaces
• Cantor sets and cyclicity in weighted Dirichlet spaces
• Cyclicity in the Dirichlet space
• Cyclicity in Dirichlet-type spaces and extremal polynomials
• Cyclicity and invariant subspaces in Dirichlet spaces
• Cyclicity in \(\ell^{p}\) spaces and zero sets of the Fourier transforms
• Hypercyclic operators on countably dimensional spaces

Cited in

(11)

• The general Albertson irregularity index of graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Upper tails via high moments and entropic stability
• Cliques in graphs excluding a complete graph minor
• A stronger bound for the strong chromatic index
• A local epsilon version of Reed's conjecture
• The maximum number of triangles in a graph and its relation to the size of the Schur multiplier of special p-groups
• Finding small complete subgraphs efficiently
• Clustering and cliques in preferential attachment random graphs with edge insertion
• Universal families of arcs and curves on surfaces
• Near uniform triangle sampling over adjacency list graph streams

This page was built for publication: Counting cycles and finite dimensional \(L^{p}\) norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867019)