Highly connected graphs have highly connected spanning bipartite subgraphs
Fuente:
arXiv
Saved in:
| Main Author: | Yuster, Raphael |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
Published: (2025)
by: Yuster, Raphael
Published: (2025)
Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)
by: Krone, Maximilian
Published: (2025)
Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)
by: Krone, Maximilian
Published: (2025)
Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)
by: Lin, Jifu, et al.
Published: (2024)
The path minimises the average size of a connected induced subgraph
by: Haslegrave, John
Published: (2021)
by: Haslegrave, John
Published: (2021)
Inducibility in $H$-free graphs and inducibility of Turán graphs
by: Yuster, Raphael
Published: (2025)
by: Yuster, Raphael
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)
by: Xu, Shaohan, et al.
Published: (2025)
A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)
by: Maezawa, Shun-ichi, et al.
Published: (2025)
Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
by: Polavarapu, Achintya Raya
Published: (2026)
by: Polavarapu, Achintya Raya
Published: (2026)
On forest and bipartite cuts in sparse graphs
by: Bogdanov, Ilya I., et al.
Published: (2025)
by: Bogdanov, Ilya I., et al.
Published: (2025)
Path-monochromatic bounded depth rooted trees in (random) tournaments
by: Yuster, Raphael
Published: (2024)
by: Yuster, Raphael
Published: (2024)
The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
The minimum size of a $k$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
The minimum size of 2-connected chordal bipartite graphs
by: Zhang, Licheng, et al.
Published: (2024)
by: Zhang, Licheng, et al.
Published: (2024)
On the maximum density of a matrix and a transcendental Turán-type density
by: Yuster, Raphael
Published: (2026)
by: Yuster, Raphael
Published: (2026)
Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)
by: Pandey, Dinesh, et al.
Published: (2025)
On Ramsey Properties of k-Majority Tournaments
by: Shapira, Asaf, et al.
Published: (2026)
by: Shapira, Asaf, et al.
Published: (2026)
Note on extremal problems about connected subgraph sums
by: Cambie, Stijn, et al.
Published: (2025)
by: Cambie, Stijn, et al.
Published: (2025)
Splits with forbidden subgraphs
by: Axenovich, Maria, et al.
Published: (2020)
by: Axenovich, Maria, et al.
Published: (2020)
Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs
by: Dong, Zichao, et al.
Published: (2025)
by: Dong, Zichao, et al.
Published: (2025)
Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)
by: Bruckamp, Justus, et al.
Published: (2024)
Simultaneous separation in bounded degree trees
by: Snir, Sagi, et al.
Published: (2026)
by: Snir, Sagi, et al.
Published: (2026)
On the extrema of the mean subtree order of graphs
by: Cambie, Stijn, et al.
Published: (2025)
by: Cambie, Stijn, et al.
Published: (2025)
The average connectivity matrix of a graph
by: Nguyen, Linh, et al.
Published: (2022)
by: Nguyen, Linh, et al.
Published: (2022)
The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
Odd-Ramsey numbers of complete bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2024)
by: Boyadzhiyska, Simona, et al.
Published: (2024)
Diameter and connectivity of finite simple graphs II
by: Hibi, Takayuki, et al.
Published: (2024)
by: Hibi, Takayuki, et al.
Published: (2024)
The least eigenvalue of the complements of graphs with given connectivity
by: Qiu, Huan, et al.
Published: (2023)
by: Qiu, Huan, et al.
Published: (2023)
Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
Characterizations of the graphs with dominating parameters
by: Ma, Yuhan
Published: (2024)
by: Ma, Yuhan
Published: (2024)
Chords of longest cycles in graphs with large circumferences
by: Wu, Haidong, et al.
Published: (2025)
by: Wu, Haidong, et al.
Published: (2025)
Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)
by: Xia, Zheng-Jiang, et al.
Published: (2026)
Maximizing subgraph counts in regular graphs
by: Lippner, Gabor, et al.
Published: (2026)
by: Lippner, Gabor, et al.
Published: (2026)
Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)
by: Cheng, Kun, et al.
Published: (2024)
Proof of the linkage conjecture for highly connected tournaments
by: Zhou, Jia, et al.
Published: (2025)
by: Zhou, Jia, et al.
Published: (2025)
Optimal spread for spanning subgraphs of Dirac hypergraphs
by: Kelly, Tom, et al.
Published: (2023)
by: Kelly, Tom, et al.
Published: (2023)
A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)
by: Zhan, Xingzhi
Published: (2024)
The connectivity dimension of a graph
by: Gottwald, Kurt Klement, et al.
Published: (2025)
by: Gottwald, Kurt Klement, et al.
Published: (2025)
An exact Ramsey number of large bipartite graphs versus odd wheel
by: Gupta, Sayan, et al.
Published: (2025)
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)
by: Li, Chengli, et al.
Published: (2024)
Similar Items
-
Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
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) -
Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024) -
The path minimises the average size of a connected induced subgraph
by: Haslegrave, John
Published: (2021)