Home ยป Good Edge Labelings

First question (almost) solved

On February 16th, 2013 Anonymous says:

Mehrabian, Mitsche, and Pralat showed that any $ n $-vertex graph with a good edge-labelling has at most $ n \log_2 n $ edges, and that for each $ n $ there is an $ n $-vertex graphs with a good edge-labelling having $ n \log_2 n - O(n) $ edges.

http://arxiv.org/abs/1211.2641

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options