Short monochromatic odd cycles
Fuente:
arXiv
Saved in:
| Main Authors: | Janzer, Oliver, Yip, Fredy |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The probability that a random graph is even-decomposable
by: Janzer, Oliver, et al.
Published: (2024)
by: Janzer, Oliver, et al.
Published: (2024)
An improved upper bound for the multicolour Ramsey number of odd cycles
by: Axenovich, Maria, et al.
Published: (2025)
by: Axenovich, Maria, et al.
Published: (2025)
On the sum of the largest and smallest eigenvalues of graphs with high odd girth
by: Yip, Fredy
Published: (2025)
by: Yip, Fredy
Published: (2025)
Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024)
by: Girão, António, et al.
Published: (2024)
Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)
by: Janzer, Oliver, et al.
Published: (2025)
Hamiltonicity of regular sublinear expanders
by: Bradač, Domagoj, et al.
Published: (2026)
by: Bradač, Domagoj, et al.
Published: (2026)
On the Turán number of the hypercube
by: Janzer, Oliver, et al.
Published: (2022)
by: Janzer, Oliver, et al.
Published: (2022)
Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
A variant of the Erdős-Gyárfás problem for $K_8$
by: Yip, Fredy
Published: (2024)
by: Yip, Fredy
Published: (2024)
The Probability That a Random Graph is Even‐Decomposable
by: Oliver Janzer, et al.
Published: (2025)
by: Oliver Janzer, et al.
Published: (2025)
Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
by: Gishboliner, Lior, et al.
Published: (2024)
by: Gishboliner, Lior, et al.
Published: (2024)
Combinatorial foundations for solvable chaotic local Euclidean quantum circuits in two dimensions
by: Yip, Fredy
Published: (2025)
by: Yip, Fredy
Published: (2025)
Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)
by: Dhawan, Abhishek, et al.
Published: (2025)
Supersaturation of odd linear cycles
by: Deng, Lirong, et al.
Published: (2025)
by: Deng, Lirong, et al.
Published: (2025)
Chromatic profiles of odd cycles
by: Yan, Zilong, et al.
Published: (2024)
by: Yan, Zilong, et al.
Published: (2024)
Regular subgraphs at every density
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Power saving for the Brown-Erdős-Sós problem
by: Janzer, Oliver, et al.
Published: (2023)
by: Janzer, Oliver, et al.
Published: (2023)
Packing the largest trees in the tree packing conjecture
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Bikernels by monochromatic paths
by: Diaz-Diaz, Dennis J., et al.
Published: (2025)
by: Diaz-Diaz, Dennis J., et al.
Published: (2025)
Any two-coloring of the plane contains monochromatic 3-term arithmetic progressions
by: Currier, Gabriel, et al.
Published: (2024)
by: Currier, Gabriel, et al.
Published: (2024)
Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)
by: Lo, Allan, et al.
Published: (2023)
Large monochromatic components in expansive hypergraphs
by: Bal, Deepak, et al.
Published: (2023)
by: Bal, Deepak, et al.
Published: (2023)
Density of monochromatic infinite subgraphs II
by: Corsten, Jan, et al.
Published: (2020)
by: Corsten, Jan, et al.
Published: (2020)
Alternating odd cycles and orientations of Kneser-like graphs
by: Almási, Nóra, et al.
Published: (2025)
by: Almási, Nóra, et al.
Published: (2025)
Obstructions for homomorphisms to odd cycles in series-parallel graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)
by: Cho, Eun-Kyung, et al.
Published: (2025)
Monochromatic odd cycles in edge-coloured complete graphs
by: Girão, António, et al.
Published: (2024)
by: Girão, António, et al.
Published: (2024)
Generalized Andrásfai--Erdős--Sós theorems for odd cycles
by: Chen, Zian, et al.
Published: (2024)
by: Chen, Zian, et al.
Published: (2024)
On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
Improved Erdős-Pósa inequalities for odd cycles in planar graphs
by: Puhlmann, Luise, et al.
Published: (2025)
by: Puhlmann, Luise, et al.
Published: (2025)
On the proper rainbow saturation numbers of cliques, paths, and odd cycles
by: Baker, Dustin, et al.
Published: (2024)
by: Baker, Dustin, et al.
Published: (2024)
Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles
by: Allen, Peter, et al.
Published: (2022)
by: Allen, Peter, et al.
Published: (2022)
A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)
by: Lin, Hao, et al.
Published: (2024)
A half-integral Erdős-Pósa theorem for directed odd cycles
by: Kawarabayashi, Ken-ichi, et al.
Published: (2020)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2020)
On the number of monochromatic solutions to multiplicative equations
by: Aragão, Lucas, et al.
Published: (2023)
by: Aragão, Lucas, et al.
Published: (2023)
Descent set distribution for permutations with cycles of only odd or only even lengths
by: Adin, Ron M., et al.
Published: (2025)
by: Adin, Ron M., et al.
Published: (2025)
Asymptotically optimal Ramsey goodness of sparse graphs versus odd cycles and paths
by: Fan, Chunchao, et al.
Published: (2025)
by: Fan, Chunchao, et al.
Published: (2025)
On 5-cycles and strong 5-subtournaments in a tournament of odd order n
by: Savchenko, Sergey
Published: (2024)
by: Savchenko, Sergey
Published: (2024)
Similar Items
-
The probability that a random graph is even-decomposable
by: Janzer, Oliver, et al.
Published: (2024) -
An improved upper bound for the multicolour Ramsey number of odd cycles
by: Axenovich, Maria, et al.
Published: (2025) -
On the sum of the largest and smallest eigenvalues of graphs with high odd girth
by: Yip, Fredy
Published: (2025) -
Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024) -
Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)