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.

2013

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

2012

A well-known theorem of de Bruijn and Erdős states that any set of $$n$$ non-collinear points in the plane determines at least…

2010

Fix integers n ≥ r ≥ 2. A clique partition of $${{[n] \choose r}}$$ is a collection of proper subsets $${A_1, A_2, \ldots, A_t…

2010

The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is hamiltonian, and if κ(G) > α(G…

2004

2002

In 1961, Erdős-Ginzburg-Ziv proved that for a given natural number n ≥ 1 and a sequence a1, a2, · · · , a2n−1 of integers (not…

1995

AbstractA De Bruijn torus is a periodicd-dimensionalk-ary array such that eachn1 × ... ×ndk-ary array appears exactly once with…

1984

1982

De Bruijn and Erdős proved that ifA1, ...,Ak are distinct subsets of a set of cardinalityn, and |Ai ∩Aj|≦1 for 1≦in, then some…

1968

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