Shortness exponent
id:
shortness-exponent-265-2250797
title:
Shortness exponent
text:
In graph theory, the shortness exponent is a numerical parameter of a family of graphs that measures how far from Hamiltonian the graphs in the family can be. Intuitively, if e is the shortness exponent of a graph family F , then every n -vertex graph in the family has a cycle of length near n e but some graphs do not have longer cycles. More precisely, for any ordering of the graphs in F into a sequence G 0 , G 1 , … , with h defined to be the length of the longest cycle in graph G , the shortn
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Shortness_exponent
date created:
date modified:
2023-08-15T21:18:25Z
main entity:
{"identifier":"Q28232438","url":"https://www.wikidata.org/entity/Q28232438"}
image:
fields total:
13
integrity:
13