Girth of sparse graphs

By B. Bollobás, Endre Szemerédi. 2002

49 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Defective and Clustered Graph Colouring (2018, background): “Since K3,3,1,1 is a minor of K∗5,3, knotlesslyembeddable graphs do not contain a K∗5,3 subgraph.”
Total chromatic number of planar graphs with maximum degree ten (2007, methodology): “In this paper, again using techniques from [2], we exhibit four intrinsically knotted graphs, each having a vertex whose removal results in a linklessly embeddable graph.”
On Differences Between DP-Coloring and List Coloring (2017, unknown): “[5], where Dirac’s theorem on the minimum number of edges in critical graphs [10, 11] is extended to the framework of DP-colorings, yielding a solution to the problem, posed by Kostochka and Stiebitz [17], of classifying list-critical graphs that satisfy Dirac’s bound with equality. 3 On the other h”