Graph and hypergraph colouring via nibble methods: A survey

06/25/2021
by   Dong Yeap Kang, et al.
0

This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the Erdős-Faber-Lovász conjecture.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/11/2020

On a Conjecture for a Hypergraph Edge Coloring Problem

Let H =(ℳ∪𝒥 ,E ∪ℰ) be a hypergraph with two hypervertices 𝒢_1 and 𝒢_2 wh...
07/29/2021

Towards a Survey on Static and Dynamic Hypergraph Visualizations

Leveraging hypergraph structures to model advanced processes has gained ...
01/15/2022

Zeon and Idem-Clifford Formulations of Hypergraph Problems

Zeon algebras have proven to be useful for enumerating structures in gra...
11/13/2020

Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture

A classic conjecture of Füredi, Kahn and Seymour (1993) states that give...
05/06/2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

In this paper we combine many of the standard and more recent algebraic ...
01/30/2013

Marginalizing in Undirected Graph and Hypergraph Models

Given an undirected graph G or hypergraph X model for a given set of var...
09/01/2020

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture

A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-unifo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.