Image de couverture de livre

Separating paths systems of almost linear size

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Letzter, Shoham
Format:	Preprint
Publié:	2022
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sublinear expanders and their applications
par: Letzter, Shoham
Publié: (2024)

Size-Ramsey numbers of tight paths
par: Letzter, Shoham, et autres
Publié: (2025)

Partitioning a tournament into sub-tournaments of high connectivity
par: Girão, António, et autres
Publié: (2022)

Exact supported co-degree bounds for Hamilton cycles
par: Letzter, Shoham, et autres
Publié: (2025)

On a problem of Brown, Erdős and Sós
par: Letzter, Shoham, et autres
Publié: (2023)

Building graphs with high minimum degree on a budget
par: Katsamaktsis, Kyriakos, et autres
Publié: (2024)

Directed cycles with zero weight in $\mathbb{Z}_p^k$
par: Letzter, Shoham, et autres
Publié: (2023)

Decomposing cubic graphs into isomorphic linear forests
par: Kronenberg, Gal, et autres
Publié: (2022)

The rainbow saturation number is linear
par: Behague, Natalie, et autres
Publié: (2022)

Chi-boundedness of graphs containing no cycles with $k$ chords
par: Lee, Joonkyung, et autres
Publié: (2022)

Rainbow subgraphs of uniformly coloured randomly perturbed graphs
par: Katsamaktsis, Kyriakos, et autres
Publié: (2023)

Packing subgraphs in regular graphs
par: Letzter, Shoham, et autres
Publié: (2025)

On the gracesize of trees
par: Letzter, Shoham, et autres
Publié: (2025)

Nearly Hamilton cycles in sublinear expanders, and applications
par: Letzter, Shoham, et autres
Publié: (2025)

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
par: Katsamaktsis, Kyriakos, et autres
Publié: (2023)

Thresholds for constrained Ramsey and anti-Ramsey problems
par: Behague, Natalie, et autres
Publié: (2024)

Cycles with almost linearly many chords
par: Draganić, Nemanja, et autres
Publié: (2026)

Separating path systems for cubic graphs and for complete bipartite graphs
par: Fernandes, Cristina, et autres
Publié: (2025)

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
par: Kang, Dong Yeap, et autres
Publié: (2020)

Minor Containment and Disjoint Paths in almost-linear time
par: Korhonen, Tuukka, et autres
Publié: (2024)

Colourings of path systems
par: Darijani, Iren, et autres
Publié: (2022)

Pancyclicity of almost-planar graphs
par: Adams, Santiago T., et autres
Publié: (2024)

The multicolour size Ramsey number of a path
par: Beke, Csongor, et autres
Publié: (2025)

Ramsey size linear and generalization
par: Hng, Eng Keat, et autres
Publié: (2026)

Separable overpartition classes and excludant sizes of an overpartition
par: Chen, Y. H., et autres
Publié: (2025)

Vertex-separating path systems in random graphs
par: Lichev, Lyuben, et autres
Publié: (2024)

A linear algorithm for radio $k$-coloring of powers of paths having small diameters
par: Chakraborty, Dipayan, et autres
Publié: (2021)

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
par: Bal, Deepak, et autres
Publié: (2023)

Cross-free families have linear size
par: Tomon, István
Publié: (2026)

Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques
par: Kontogeorgiou, George, et autres
Publié: (2024)

$C_5$ is almost a fractalizer
par: Lidický, Bernard, et autres
Publié: (2021)

$s$-almost $t$-intersecting families for vector spaces
par: Yu, Shuhui, et autres
Publié: (2024)

On almost Gallai colourings in complete graphs
par: Grebennikov, Alexandr, et autres
Publié: (2025)

The Capelli eigenvalue problem for quantum groups
par: Letzter, Gail, et autres
Publié: (2022)

Coloring graphs with forbidden almost bipartite subgraphs
par: Anderson, James, et autres
Publié: (2022)

On the nonexistence of almost Moore digraphs with self-repeats
par: Messegué, Arnau, et autres
Publié: (2024)

$s$-almost cross-$t$-intersecting families for vector spaces
par: Liu, Dehai, et autres
Publié: (2026)

On partition and almost disjoint properties of combinatorial notions
par: Zhang, Teng
Publié: (2025)

Graph with any rational density and no rich subsets of linear size
par: Im, Seonghyuk, et autres
Publié: (2024)

Infinitely many minimally non-Ramsey size-linear graphs
par: Wigderson, Yuval
Publié: (2024)