:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Filmus, Yuval, Hatami, Hamed, Hosseini, Kaave, Kelman, Esty
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2311.12248
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Kelley--Meka bounds for sets free of three-term arithmetic progressions
by: Bloom, Thomas F., et al.
Published: (2023)

Aggregation of evaluations without unanimity
by: Filmus, Yuval
Published: (2025)

Sparse juntas on the biased hypercube
by: Dinur, Irit, et al.
Published: (2017)

Classification aggregation: a quantitative impossibility theorem
by: Filmus, Yuval
Published: (2026)

A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
by: Frick, Florian, et al.
Published: (2026)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

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

Sensitivity and Hamming graphs
by: Asensio, Sara, et al.
Published: (2025)

Refuting approaches to the log-rank conjecture for XOR functions
by: Hatami, Hamed, et al.
Published: (2023)

Effective MC-finiteness
by: Filmus, Yuval, et al.
Published: (2025)

Boolean functions on high-dimensional expanders
by: Dikstein, Yotam, et al.
Published: (2018)

Boolean Functions with Small Approximate Spectral Norm
by: Cheung, Tsun-Ming, et al.
Published: (2024)

Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]
by: Wigderson, Yuval
Published: (2024)

Infinitely many minimally non-Ramsey size-linear graphs
by: Wigderson, Yuval
Published: (2024)

Online versus Offline Adversaries in Property Testing
by: Kelman, Esty, et al.
Published: (2024)

On Optimal Testing of Linearity
by: Arora, Vipul, et al.
Published: (2024)

Embedding theorems for random graphs with specified degrees
by: Gao, Pu, et al.
Published: (2023)

The inertia bound is far from tight
by: Kwan, Matthew, et al.
Published: (2023)

Regularity for hypergraphs with bounded VC$_2$ dimension
by: Gishboliner, Lior, et al.
Published: (2025)

Blowups of triangle-free graphs
by: Girão, António, et al.
Published: (2024)

Counting subgraphs in locally dense graphs
by: Bradač, Domagoj, et al.
Published: (2024)

Asymmetric results about graph homomorphisms
by: Gishboliner, Lior, et al.
Published: (2025)

Optimal Testing of Reed-Muller Codes with an Online Adversary
by: Kelman, Esty, et al.
Published: (2026)

Ordered Ramsey numbers of graphs with $m$ edges
by: Bradač, Domagoj, et al.
Published: (2024)

An identity involving counts of binary matrices
by: Leeb, Hannes
Published: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
by: Gao, Pu, et al.
Published: (2020)

Jacobian graphs
by: Forey, Arthur, et al.
Published: (2026)

Homomorphism Testing with Resilience to Online Manipulations
by: Kelman, Esty, et al.
Published: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph
by: Mella, Lotrenzo, et al.
Published: (2025)

Canonical Ramsey numbers of sparse graphs
by: Gishboliner, Lior, et al.
Published: (2024)

On the $Δ$-edge stability number of graphs
by: Akbari, Saieed, et al.
Published: (2024)

An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)

Star observations in bounded-degree graphs
by: Szegedy, Balazs
Published: (2026)

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)