De Bruijn–Erdős theorem (graph theory)

Known as: De Bruijn-Erdős theorem (graph coloring), De Bruijn–Erdős theorem (graph coloring), De Bruijn

In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and Paul Erdős (), states that, for every infinite graph G and…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2013

Given a convex body K\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage…

2011

Abstract In this note, we prove that the projective normality of (ℙ(V)/G, ℒ), the celebrated theorem of Erdős–Ginzburg–Ziv and…

1992

A miniswap Si, 1 S i < n, compares two adjacent keys 11"i, 11"i+l in the sequence {1r1 , ... , 7rn}, and transposes them if they…

1968

Throughout this paper, G will denote a locally compact Hausdorff group with a chosen left Haar measure m. For each s ∈ G, τs…

1952