Betti numbers of unordered configuration spaces of small graphs

06/03/2019
by   Gabriel C. Drummond-Cole, et al.
0

The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort. It contains information for connected multigraphs having at most six edges which contain no loops, no bivalent vertices, and no internal (i.e., non-leaf) bridges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2020

The giant component of the directed configuration model revisited

We prove a law of large numbers for the order and size of the largest st...
research
09/02/2021

Ramsey Numbers of Trails

We initiate the study of Ramsey numbers of trails. Let k ≥ 2 be a positi...
research
10/25/2022

Parallel Order-Based Core Maintenance in Dynamic Graphs

The core numbers of vertices in a graph are one of the most well-studied...
research
10/19/2021

Eternal Domination and Clique Covering

We study the relationship between the eternal domination number of a gra...
research
01/24/2017

Computations with p-adic numbers

This document contains the notes of a lecture I gave at the "Journées Na...
research
11/22/2021

The n-queens completion problem

An n-queens configuration is a placement of n mutually non-attacking que...
research
05/01/2020

A Generic Framework and Library for Exploration of Small Multiples through Interactive Piling

Small multiples are miniature representations of visual information used...

Please sign up or login with your details

Forgot password? Click here to reset