Cover Image

On forest and bipartite cuts in sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bogdanov, Ilya I., Neustroeva, Elizaveta, Sokolov, Georgy, Volostnov, Alexei, Russkin, Nikolay, Voronov, Vsevolod
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C35, 05C40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the chromatic number of the plane for map-type colorings
by: Sokolov, Georgy, et al.
Published: (2025)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

On the extrema of the mean subtree order of graphs
by: Cambie, Stijn, et al.
Published: (2025)

Odd-Ramsey numbers of complete bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2024)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)

Characterizations of the graphs with dominating parameters
by: Ma, Yuhan
Published: (2024)

Chords of longest cycles in graphs with large circumferences
by: Wu, Haidong, et al.
Published: (2025)

Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)

The minimum size of a $k$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2025)

The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)

A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)

An exact Ramsey number of large bipartite graphs versus odd wheel
by: Gupta, Sayan, et al.
Published: (2025)

Bound vertices of longest paths between two vertices in cubic graphs
by: Li, Chengli, et al.
Published: (2024)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Tiling randomly perturbed bipartite graphs
by: Gomez-Leos, Enrique, et al.
Published: (2024)

Asymmetric list sizes in bipartite graphs
by: Alon, Noga, et al.
Published: (2020)

Turán number of books in non-bipartite graphs
by: Miao, Lu, et al.
Published: (2025)

Spectral radius and rainbow Hamiltonicity in bipartite graphs
by: chen, Meng, et al.
Published: (2026)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

The minimum size of 2-connected chordal bipartite graphs
by: Zhang, Licheng, et al.
Published: (2024)

Turán number of the odd-ballooning of complete bipartite graphs
by: Peng, Xing, et al.
Published: (2023)

A note on the sizes of bipartite 1-planar graphs
by: Wang, Guiping
Published: (2025)

Equitable list coloring of sparse graphs
by: Kierstead, H. A., et al.
Published: (2024)

Spectral Turán problem of non-bipartite graphs: Forbidden books
by: Liu, Ruifang, et al.
Published: (2025)

Bipartite Turán problems via graph gluing
by: Dong, Zichao, et al.
Published: (2025)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

On the most reliable graphs with fixed redundancy
by: Brand, Rotem, et al.
Published: (2026)

On asymptotic packing of convex geometric and ordered graphs
by: Nie, Jiaxi, et al.
Published: (2022)

Spectral extremal problems for non-bipartite graphs without odd cycles
by: Zou, Lantao, et al.
Published: (2025)

Turán numbers for non-bipartite graphs and applications to spectral extremal problems
by: Fang, Longfei, et al.
Published: (2024)

A spectral extremal problem on non-bipartite triangle-free graphs
by: Li, Yongtao, et al.
Published: (2023)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)

The path minimises the average size of a connected induced subgraph
by: Haslegrave, John
Published: (2021)

Induced Turán problem in bipartite graphs
by: Axenovich, Maria, et al.
Published: (2024)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
by: Liu, Jianxi
Published: (2026)

Separating path systems for cubic graphs and for complete bipartite graphs
by: Fernandes, Cristina, et al.
Published: (2025)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)