4.3 Article

Entropy compression versus Lovasz Local Lemma

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

Finding independent transversals efficiently

Alessandra Graf et al.

COMBINATORICS PROBABILITY & COMPUTING (2020)

Article Mathematics

A new bound on the acyclic edge chromatic number

Paula M. S. Fialho et al.

DISCRETE MATHEMATICS (2020)

Article Physics, Mathematical

Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma

Aldo Procacci et al.

ANNALES DE L INSTITUT HENRI POINCARE D (2018)

Article Computer Science, Interdisciplinary Applications

Improved upper bound for the degenerate and star chromatic numbers of graphs

Jiansheng Cai et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)

Article Mathematics

The Local Cut Lemma

Anton Bernshteyn

EUROPEAN JOURNAL OF COMBINATORICS (2017)

Article Mathematics

Asymptotic Size of Covering Arrays: An Application of Entropy Compression

Nevena Francetic et al.

JOURNAL OF COMBINATORIAL DESIGNS (2017)

Article Computer Science, Theory & Methods

Acyclic edge coloring through the Lovasz Local Lemma

Ioannis Giotis et al.

THEORETICAL COMPUTER SCIENCE (2017)

Article Mathematics

NONREPETITIVE COLOURING VIA ENTROPY COMPRESSION

Vida Dujmovic et al.

COMBINATORICA (2016)

Article Mathematics

On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method

Jakub Przybylo et al.

GRAPHS AND COMBINATORICS (2016)

Article Mathematics

On the Facial Thue Choice Index via Entropy Compression

Jakub Przybylo

JOURNAL OF GRAPH THEORY (2014)

Article Mathematics, Applied

AN EXTENSION OF THE MOSER-TARDOS ALGORITHMIC LOCAL LEMMA

Wesley Pegden

SIAM JOURNAL ON DISCRETE MATHEMATICS (2014)

Article Mathematics

Acyclic edge-coloring using entropy compression

Louis Esperet et al.

EUROPEAN JOURNAL OF COMBINATORICS (2013)

Article Computer Science, Software Engineering

New approach to nonrepetitive sequences

Jaroslaw Grytczuk et al.

RANDOM STRUCTURES & ALGORITHMS (2013)

Article Mathematics

Improved bounds on coloring of graphs

Sokol Ndreca et al.

EUROPEAN JOURNAL OF COMBINATORICS (2012)

Article Computer Science, Software Engineering

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Julia Boettcher et al.

RANDOM STRUCTURES & ALGORITHMS (2012)

Article Computer Science, Theory & Methods

An Improvement of the Lovasz Local Lemma via Cluster Expansion

Rodrigo Bissacot et al.

COMBINATORICS PROBABILITY & COMPUTING (2011)

Article Computer Science, Hardware & Architecture

A Constructive Proof of the General Lovasz Local Lemma

Robin A. Moser et al.

JOURNAL OF THE ACM (2010)

Article Physics, Mathematical

Cluster expansion for abstract polymer models.: New bounds from an old approach

Roberto Fernandez et al.

COMMUNICATIONS IN MATHEMATICAL PHYSICS (2007)

Article Mathematics

Extremal problems for transversals in graphs with bounded degree

Tibor Szabo et al.

COMBINATORICA (2006)

Review Physics, Mathematical

The repulsive lattice gas, the independent-set polynomial, and the Lovasz local lemma

AD Scott et al.

JOURNAL OF STATISTICAL PHYSICS (2005)

Article Computer Science, Theory & Methods

A note on vertex list colouring

PE Haxell

COMBINATORICS PROBABILITY & COMPUTING (2001)