Formalizing Graph Trail Properties in Isabelle/HOL

03/05/2021
by   Laura Kovács, et al.
0

We describe a dataset expressing and proving properties of graph trails, using Isabelle/HOL. We formalize the reasoning about strictly increasing and decreasing trails, using weights over edges, and prove lower bounds over the length of trails in weighted graphs. We do so by extending the graph theory library of Isabelle/HOL with an algorithm computing the length of a longest strictly decreasing graph trail starting from a vertex for a given weight distribution, and prove that any decreasing trail is also an increasing one. This preprint has been accepted for publication at CICM 2020.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2019

Variable degeneracy on toroidal graphs

Let f be a nonnegative integer valued function on the vertex-set of a gr...
research
09/13/2017

Lower Bounds for Approximating Graph Parameters via Communication Complexity

We present a new framework for proving query complexity lower bounds for...
research
05/23/2022

Eigenvalue bounds of the Kirchhoff Laplacian

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a gra...
research
01/31/2022

Polynomial kernels for edge modification problems towards block and strictly chordal graphs

We consider edge modification problems towards block and strictly chorda...
research
09/16/2022

On Weighted Graph Sparsification by Linear Sketching

A seminal work of [Ahn-Guha-McGregor, PODS'12] showed that one can compu...
research
08/13/2013

Extended Distributed Learning Automata:A New Method for Solving Stochastic Graph Optimization Problems

In this paper, a new structure of cooperative learning automata so-calle...
research
10/19/2020

Gray codes for Fibonacci q-decreasing words

An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...

Please sign up or login with your details

Forgot password? Click here to reset