Cover Image

Counterexamples to an Extremal Conjecture for Random Cycle-Factors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gajjala, Rishikesh
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)

Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024)

Random 0/1-polytopes expand rapidly
by: Guo, He, et al.
Published: (2026)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

A threshold for online balancing of sparse i.i.d. vectors
by: Altschuler, Dylan J., et al.
Published: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

A binomial random multigraph
by: Pelekis, Christos
Published: (2023)

A lower bound on the spectrum of unimodular networks
by: Rahman, Mustazee
Published: (2016)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)

Cutoff profile of the Metropolis biased card shuffling
by: Zhang, Lingfu
Published: (2022)

Graph-theoretic insights on the constructability of complex entangled states
by: Chandran, L. Sunil, et al.
Published: (2023)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)