Image de couverture de livre

A note on Ordered Ruzsa-Szemerédi graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Pratt, Kevin
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
par: Behnezhad, Soheil, et autres
Publié: (2024)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
par: Assadi, Sepehr, et autres
Publié: (2024)

An algorithmic Polynomial Freiman-Ruzsa theorem
par: Castro-Silva, Davi, et autres
Publié: (2026)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
par: Bedert, Benjamin, et autres
Publié: (2025)

Improved exploration of temporal graphs
par: Bastide, Paul, et autres
Publié: (2025)

Reconstructing edge-deleted unicyclic graphs
par: Pizzimenti, Anthony E., et autres
Publié: (2024)

Faithful universal graphs for minor-closed classes
par: Bastide, Paul, et autres
Publié: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
par: Yang, Chenxu, et autres
Publié: (2023)

On the complexity of edge subdivision to $H$-free graphs
par: Piecyk, Marta, et autres
Publié: (2026)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
par: Jenssen, Matthew, et autres
Publié: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
par: Piecyk, Marta, et autres
Publié: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

Sampling and counting triangle-free graphs near the critical density
par: Jenssen, Matthew, et autres
Publié: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
par: Hegde, Anand Shripad, et autres
Publié: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Making an oriented graph acyclic using inversions of bounded or prescribed size
par: Bang-Jensen, Jørgen, et autres
Publié: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
par: Fang, Qiming, et autres
Publié: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
par: Bonamy, Marthe, et autres
Publié: (2022)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
par: Biedl, Therese
Publié: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
par: Daga, Mohit
Publié: (2025)

The connectivity carcass of a vertex subset in a graph: both odd and even case
par: Baswana, Surender, et autres
Publié: (2025)

Burning rooted graph products
par: Peca-Medlin, John
Publié: (2026)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Smoothed analysis for graph isomorphism
par: Anastos, Michael, et autres
Publié: (2024)

A Note on Generic Tangle Algorithms
par: Elbracht, Christian, et autres
Publié: (2020)

A Combinatorial Characterization of Constant Mixing Time
par: Lau, Lap Chi, et autres
Publié: (2025)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
par: Kanaya, Yuga, et autres
Publié: (2023)

A Maximum Linear Arrangement Problem on Directed Graphs
par: DeVos, Matt, et autres
Publié: (2018)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
par: Kuszmaul, William
Publié: (2025)

A Unified View of Graph Regularity via Matrix Decompositions
par: Bodwin, Greg, et autres
Publié: (2019)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
par: Dumitrescu, Adrian
Publié: (2024)