Improved bounds for randomly colouring simple hypergraphs

Weiming Feng, Heng Guo, Jiaheng Wang

Type: Preprint

Publication Date: 2022-01-01

Citations: 2

DOI: https://doi.org/10.48550/arxiv.2202.05554

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Perfectly Sampling k\geq (8/3 +o(1))\Delta-Colorings in Graphs	2021	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Perfectly Sampling $k\geq (8/3 +o(1))Δ$-Colorings in Graphs	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+ PDF Chat	Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs	2022	Siddharth Bhandari Sayantan Chakraborty
+ PDF Chat	Counting hypergraph colourings in the local lemma regime	2018	Heng Guo Chao Liao Pinyan Lu Chihao Zhang
+	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture	2020	Georg Anegg Haris Angelidakis Rico Zenklusen
+	Randomly coloring simple hypergraphs with fewer colors	2017	Michael Anastos Alan Frieze
+	Randomly coloring simple hypergraphs with fewer colors	2017	Michael Anastos Alan Frieze
+ PDF Chat	Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle	2022	Holger Dell John Lapinskas Kitty Meeks
+ PDF Chat	Randomly coloring simple hypergraphs	2011	Alan Frieze Páll Melsted
+	Counting hypergraph colorings in the local lemma regime	2017	Heng Guo Chao Liao Pinyan Lu Chihao Zhang
+ PDF Chat	Counting Hypergraph Colorings in the Local Lemma Regime	2019	Heng Guo Chao Liao Pinyan Lu Chihao Zhang
+ PDF Chat	Approximately counting and sampling small witnesses using a colourful decision oracle	2019	Holger Dell John Lapinskas Kitty Meeks
+ PDF Chat	Randomly coloring simple hypergraphs with fewer colors	2017	Alan Frieze Michael Anastos
+ PDF Chat	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs	2019	Hiệp Hàn Jie Han Patrick Morris
+	Finding Perfect Matchings in Dense Hypergraphs	2019	Jie Han Peter Keevash
+ PDF Chat	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture	2021	Georg Anegg Haris Angelidakis Rico Zenklusen
+	Efficient and near-optimal algorithms for sampling connected subgraphs	2021	Marco Bressan
+	Randomly coloring graphs of bounded treewidth	2017	Shai Vardi
+	Tight Hamilton cycles with high discrepancy	2023	Lior Gishboliner Stefan Glock Amedeo Sgueglia

Works That Cite This (2)

Action	Title	Year	Authors
+ PDF Chat	Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time	2022	Kun He Chunyang Wang Yitong Yin
+ PDF Chat	Towards derandomising Markov chain Monte Carlo	2023	Weiming Feng Heng Guo Chunyang Wang Jiaheng Wang Yitong Yin

Works Cited by This (0)

Action	Title	Year	Authors