Localized Erdős-Pósa Property for Subdivisions
Fuente:
arXiv
Guardado en:
| Autores principales: | Ai, Icey Siyi, Chudnovsky, Maria, Codsi, Julien |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A coarse Erdős-Pósa theorem
por: Ahn, Jungho, et al.
Publicado: (2024)
por: Ahn, Jungho, et al.
Publicado: (2024)
Induced minors and subpolynomial treewidth
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
por: Chudnovsky, Maria, et al.
Publicado: (2026)
por: Chudnovsky, Maria, et al.
Publicado: (2026)
Tree-independence number VI. Thetas and pyramids
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
por: Kovář, Petr, et al.
Publicado: (2025)
por: Kovář, Petr, et al.
Publicado: (2025)
Minimum covering by triples, quadruples and quintuples with minimum excess
por: Kovář, Petr, et al.
Publicado: (2026)
por: Kovář, Petr, et al.
Publicado: (2026)
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
por: Gollin, J. Pascal, et al.
Publicado: (2022)
por: Gollin, J. Pascal, et al.
Publicado: (2022)
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
por: Gollin, J. Pascal, et al.
Publicado: (2021)
por: Gollin, J. Pascal, et al.
Publicado: (2021)
Decomposition of Cliques into $k$-Star-Forests
por: Nie, Jiaxi, et al.
Publicado: (2025)
por: Nie, Jiaxi, et al.
Publicado: (2025)
A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
por: Kovař, Petr, et al.
Publicado: (2026)
por: Kovař, Petr, et al.
Publicado: (2026)
Difference Methods for Double-Change Covering Designs
por: Chafee, Amanda Lynn, et al.
Publicado: (2022)
por: Chafee, Amanda Lynn, et al.
Publicado: (2022)
The Erdős-Pósa property for prime-length cycles fails (and beyond)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
Sets of equiangular lines in dimension $18$ constructed from $A_9 \oplus A_9 \oplus A_1$
por: Lin, Yen-chi Roger, et al.
Publicado: (2025)
por: Lin, Yen-chi Roger, et al.
Publicado: (2025)
A cube dismantling problem related to bootstrap percolation
por: Barát, János, et al.
Publicado: (2026)
por: Barát, János, et al.
Publicado: (2026)
Tree independence number V. Walls and claws
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
On essentially 4-edge-connected cubic bricks
por: Kothari, Nishad, et al.
Publicado: (2018)
por: Kothari, Nishad, et al.
Publicado: (2018)
Incidence-free sets and edge domination in incidence graphs
por: Spiro, Sam, et al.
Publicado: (2022)
por: Spiro, Sam, et al.
Publicado: (2022)
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
por: Heering, Philipp, et al.
Publicado: (2026)
por: Heering, Philipp, et al.
Publicado: (2026)
Local dimer dynamics in higher dimensions
por: Hartarsky, Ivailo, et al.
Publicado: (2023)
por: Hartarsky, Ivailo, et al.
Publicado: (2023)
Perfect $1$-factorisations of $K_{11,11}$
por: Allsop, Jack, et al.
Publicado: (2025)
por: Allsop, Jack, et al.
Publicado: (2025)
The linear system for Sudoku and a fractional completion threshold
por: Dukes, Peter J., et al.
Publicado: (2023)
por: Dukes, Peter J., et al.
Publicado: (2023)
The Erdős-Pósa property for infinite graphs
por: Krill, Thilo
Publicado: (2024)
por: Krill, Thilo
Publicado: (2024)
The wild number of an edge-colored graph
por: Anders, Katie, et al.
Publicado: (2025)
por: Anders, Katie, et al.
Publicado: (2025)
Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
por: Polavarapu, Achintya Raya
Publicado: (2026)
por: Polavarapu, Achintya Raya
Publicado: (2026)
On the spouse-loving variant of the Oberwolfach problem
por: Bolohan, Noah, et al.
Publicado: (2024)
por: Bolohan, Noah, et al.
Publicado: (2024)
Optimal bounds for an Erdős problem on matching integers to distinct multiples
por: van Doorn, Wouter, et al.
Publicado: (2026)
por: van Doorn, Wouter, et al.
Publicado: (2026)
An Erdős problem on random subset sums in finite abelian groups
por: Ma, Jie, et al.
Publicado: (2026)
por: Ma, Jie, et al.
Publicado: (2026)
Property O and Erdős--Szekeres properties in linear hypergraphs
por: Jiang, Suyun, et al.
Publicado: (2025)
por: Jiang, Suyun, et al.
Publicado: (2025)
The Erdős-Pósa property for circle graphs as vertex-minors
por: Campbell, Rutger, et al.
Publicado: (2025)
por: Campbell, Rutger, et al.
Publicado: (2025)
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
por: Borgwardt, Steffen, et al.
Publicado: (2025)
por: Borgwardt, Steffen, et al.
Publicado: (2025)
Toward a Three-dimensional Counterpart of Cruse's Theorem
por: Bahmanian, Amin
Publicado: (2022)
por: Bahmanian, Amin
Publicado: (2022)
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
por: Paul, Christophe, et al.
Publicado: (2024)
por: Paul, Christophe, et al.
Publicado: (2024)
Obstructions to Erdős-Pósa Dualities for Minors
por: Paul, Christophe, et al.
Publicado: (2024)
por: Paul, Christophe, et al.
Publicado: (2024)
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
por: Delcourt, Michelle, et al.
Publicado: (2022)
por: Delcourt, Michelle, et al.
Publicado: (2022)
Positive matching decompositions of the cartesian product of graphs
por: Ghouchan, Mohammad Farrokhi Derakhshandeh, et al.
Publicado: (2025)
por: Ghouchan, Mohammad Farrokhi Derakhshandeh, et al.
Publicado: (2025)
Dominated balanced separators in wheel-induced-minor-free graphs
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
Sufficient conditions for a graph with minimum degree to have a component factor
por: Wu, Jie
Publicado: (2025)
por: Wu, Jie
Publicado: (2025)
Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
por: Wang, Sufang, et al.
Publicado: (2025)
por: Wang, Sufang, et al.
Publicado: (2025)
Some results on the k-strong parity property in a graph
por: Wu, Jie
Publicado: (2025)
por: Wu, Jie
Publicado: (2025)
Flexibility and rigidity of frameworks consisting of triangles and parallelograms
por: Grasegger, Georg, et al.
Publicado: (2023)
por: Grasegger, Georg, et al.
Publicado: (2023)
Ejemplares similares
-
A coarse Erdős-Pósa theorem
por: Ahn, Jungho, et al.
Publicado: (2024) -
Induced minors and subpolynomial treewidth
por: Chudnovsky, Maria, et al.
Publicado: (2025) -
Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
por: Chudnovsky, Maria, et al.
Publicado: (2026) -
Tree-independence number VI. Thetas and pyramids
por: Chudnovsky, Maria, et al.
Publicado: (2025) -
Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
por: Kovář, Petr, et al.
Publicado: (2025)