:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Alon, Noga, Milanič, Martin, Rzążewski, Paweł
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics
Online Access:	https://arxiv.org/abs/2511.03864
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Sumsets in the Hypercube
by: Alon, Noga, et al.
Published: (2024)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Burling graphs in graphs with large chromatic number
by: Abrishami, Tara, et al.
Published: (2025)

Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)

On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

On Computational Aspects of Cores of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
by: Agdur, Vilhelm, et al.
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

Constant congestion brambles in directed graphs
by: Masařík, Tomáš, et al.
Published: (2021)

The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
by: Adler, Isolde, et al.
Published: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
by: Majewski, Konrad, et al.
Published: (2022)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Clique-Width: Harnessing the Power of Atoms
by: Dabrowski, Konrad K., et al.
Published: (2020)

There is no prime functional digraph: Seifert's proof revisited
by: Richard, Adrien
Published: (2025)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)