☆ 4.2 Article

Defective coloring of hypergraphs

RANDOM STRUCTURES & ALGORITHMS (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Mathematics, Applied

A GENERAL FRAMEWORK FOR HYPERGRAPH COLORING

Ian M. Wanless et al.

Summary: The Lovasz Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects. This paper presents a general theorem for coloring hypergraphs that matches or slightly improves upon the bounds obtained using the Lovasz Local Lemma. The theorem also shows that there are exponentially many colorings. The proof is elementary and self-contained, inspired by recent results for nonrepetitive colorings. The authors apply the general theorem in various settings.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2022)

添加到收藏夹

Article Mathematics

Partitions of hypergraphs under variable degeneracy constraints

Thomas Schweser et al.

Summary: The paper addresses the partitioning of hypergraphs into induced subhypergraphs with constraints on their degeneracy under vertex functions. The goal is to find a sequence of vertex-disjoint induced subhypergraphs containing all vertices of the hypergraph, each of which is strictly degenerate based on the respective vertex function.

JOURNAL OF GRAPH THEORY (2021)

添加到收藏夹

Article Mathematics

Improved bounds for the sunflower lemma

Ryan Alweiss et al.

Summary: The sunflower lemma states that for a family of sets of size w, containing at least about w(w) sets, there must be a sunflower with r petals. This paper presents a new definition for sunflowers and improves the bound on the number of sets to about (log w)(w).

ANNALS OF MATHEMATICS (2021)

添加到收藏夹

Article Mathematics

Note on sunflowers

Tolson Bell et al.

Summary: The sunflower problem aims to find the smallest r such that any family of r distinct k-element sets contains a sunflower with p petals. It has been shown that r = O(p log k) suffices by using a minor variant of recent proofs.

DISCRETE MATHEMATICS (2021)

添加到收藏夹

Article Mathematics

Thresholds versus fractional expectation-thresholds

Keith Frankston et al.

Summary: This research validates Talagrand's conjecture and proves some challenging results and conjectures in probabilistic combinatorics, including perfect hypergraph matchings and bounded degree spanning trees.

ANNALS OF MATHEMATICS (2021)

添加到收藏夹

Article Mathematics

Improper colourings inspired by Hadwiger's conjecture

Jan van den Heuvel et al.

JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES (2018)

添加到收藏夹

Article Mathematics

SPARSE HYPERGRAPHS WITH LOW INDEPENDENCE NUMBER

Jeff Cooper et al.

COMBINATORICA (2017)

添加到收藏夹

Article Mathematics

On judicious partitions of uniform hypergraphs

Jianfeng Hou et al.

JOURNAL OF COMBINATORIAL THEORY SERIES A (2016)

添加到收藏夹

Article Mathematics, Applied

COLORING SPARSE HYPERGRAPHS

Jeff Cooper et al.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2016)

添加到收藏夹

Article Mathematics

On judicious partitions of hypergraphs with edges of size at most 3

Yao Zhang et al.

EUROPEAN JOURNAL OF COMBINATORICS (2015)

添加到收藏夹

Article Mathematics, Applied

A RELATIVE OF HADWIGER'S CONJECTURE

Katherine Edwards et al.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2015)

添加到收藏夹

Article Computer Science, Software Engineering

List Coloring Triangle-Free Hypergraphs

Jeff Cooper et al.

RANDOM STRUCTURES & ALGORITHMS (2015)

添加到收藏夹

Article Mathematics

Judicious partitions of uniform hypergraphs

John Haslegrave

COMBINATORICA (2014)

添加到收藏夹

Article Mathematics

Coloring simple hypergraphs

Alan Frieze et al.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2013)

添加到收藏夹

Article Computer Science, Theory & Methods

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges

A. Kostochka et al.

COMBINATORICS PROBABILITY & COMPUTING (2012)

添加到收藏夹

Article Computer Science, Information Systems

Randomly coloring simple hypergraphs

Alan Frieze et al.

INFORMATION PROCESSING LETTERS (2011)

添加到收藏夹

Article Mathematics

Max k-cut and judicious k-partitions

Bela Bollobas et al.

DISCRETE MATHEMATICS (2010)

添加到收藏夹

Article Computer Science, Software Engineering

Coloring H-Free Hypergraphs

Tom Bohman et al.

RANDOM STRUCTURES & ALGORITHMS (2010)

添加到收藏夹

Article Mathematics

Judicious k-partitions of graphs

Baogang Xu et al.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2009)

添加到收藏夹

Article Computer Science, Software Engineering

Coloring Uniform Hypergraphs With Few Edges

A. V. Kostochka et al.

RANDOM STRUCTURES & ALGORITHMS (2009)

添加到收藏夹

Article Mathematics

Judicious partitions of bounded-degree graphs

B Bollobás et al.

JOURNAL OF GRAPH THEORY (2004)

添加到收藏夹

Article Mathematics

Maximum cuts and judicious partitions in graphs without short cycles

N Alon et al.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2003)

添加到收藏夹

Article Computer Science, Software Engineering

Problems and results on judicious partitions

B Bollobás et al.

RANDOM STRUCTURES & ALGORITHMS (2002)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.