Cover Image

A stepping-up lemma for monotone paths with bounded color complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Choi, Jigang, Lee, Hyunwoo
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Transversal cycles and paths in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Blow-up lemmas for sparse graphs
by: Allen, Peter, et al.
Published: (2016)

The ineffectiveness of the regularity lemma for bounded degree graphs
by: Lyons, Clark, et al.
Published: (2025)

Enumerating several statistics of r-Colored Dyck paths with no dd-steps having the same colors
by: Sun, Yidong, et al.
Published: (2025)

Color avoidance for monotone paths
by: Mulrenin, Eion, et al.
Published: (2024)

Towards a high-dimensional Dirac's theorem
by: Lee, Hyunwoo
Published: (2023)

Random matchings in linear hypergraphs
by: Lee, Hyunwoo
Published: (2024)

Spanning subdivisions in dense digraphs
by: Lee, Hyunwoo
Published: (2023)

On Sidorenko exponents of hypergraphs
by: Lee, Hyunwoo
Published: (2025)

On perfect subdivision tilings
by: Lee, Hyunwoo
Published: (2023)

Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly
by: Ardila-Mantilla, Federico, et al.
Published: (2024)

3-uniform monotone paths and multicolor Ramsey numbers
by: Suk, Andrew, et al.
Published: (2024)

A quantitative improvement on the hypergraph Balog-Szemerédi-Gowers theorem
by: Lee, Hyunwoo
Published: (2025)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

Packing coloring of graphs with long paths
by: Furmańczyk, Hanna, et al.
Published: (2025)

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

Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024)

Dense triangle-free $(n, d, λ)$-graphs for all orders
by: Kim, Jaehoon, et al.
Published: (2024)

Eigenvalue bounds for distance-edge colorings
by: Abiad, Aida, et al.
Published: (2025)

All passable games are realizable as monotone set coloring games
by: Demer, Eric, et al.
Published: (2021)

On a rainbow extremal problem for color-critical graphs
by: Chakraborti, Debsoumya, et al.
Published: (2022)

Polynomial removal lemma for ordered matchings
by: Gishboliner, Lior, et al.
Published: (2023)

Towards an optimal hypergraph container lemma
by: Campos, Marcelo, et al.
Published: (2024)

An improved construction for the triangle removal lemma
by: Hunter, Zach
Published: (2025)

Vertices of the monotone path polytopes of hypersimplicies
by: Poullot, Germain
Published: (2024)

Extending partial edge colorings of iterated cartesian products of cycles and paths
by: Casselgren, Carl Johan, et al.
Published: (2023)

Three-coloring triangle-free graphs without long forbidden paths
by: Zhou, Yidong, et al.
Published: (2025)

Improved upper bounds on color reversal by local inversions
by: Porte, Kumud Singh, et al.
Published: (2025)

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
by: Bal, Deepak, et al.
Published: (2023)

A linear algorithm for radio $k$-coloring of powers of paths having small diameters
by: Chakraborty, Dipayan, et al.
Published: (2021)

An efficient asymmetric removal lemma and its limitations
by: Gishboliner, Lior, et al.
Published: (2023)

Between proper and square colorings of sparse graphs
by: Choi, Ilkyoo, et al.
Published: (2025)

Motzkin paths with two variants of level steps on odd levels -- a kernel method approach
by: Prodinger, Helmut
Published: (2026)

Some lemmas on spectral radius of graphs: including an application
by: Zhang, Wenqian
Published: (2026)

On the (in)equivalence of Brouwer's fixed point theorem and Sperner's lemma
by: Minagawa, Junichi
Published: (2025)

A strengthening of Chang's lemma
by: Carenini, Gaia, et al.
Published: (2026)

Spanning clique subdivisions in pseudorandom graphs
by: Lee, Hyunwoo, et al.
Published: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

On graphs with girth at least five achieving Steffen's edge coloring bound
by: Chen, Guantao, et al.
Published: (2026)

Extending partial edge-colorings of bounded size in Cartesian products of graphs
by: Bärnkopf, Pál, et al.
Published: (2026)