Color-avoiding connected spanning subgraphs with minimum number of edges
Fuente:
arXiv
Saved in:
| Main Authors: | Pintér, József, Varga, Kitti |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Color-avoiding connected colorings and orientations
by: Pintér, József, et al.
Published: (2025)
by: Pintér, József, et al.
Published: (2025)
Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)
by: Huang, Ting, et al.
Published: (2025)
Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026)
by: Pintér, József
Published: (2026)
Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)
by: Krone, Maximilian
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)
On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)
by: Shabanov, Dmitry, et al.
Published: (2025)
Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)
by: Li, Binlong, et al.
Published: (2025)
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)
Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)
by: Yuster, Raphael
Published: (2024)
Highly connected orientations from edge-disjoint rigid subgraphs
by: Garamvölgyi, Dániel, et al.
Published: (2024)
by: Garamvölgyi, Dániel, et al.
Published: (2024)
Minimal toughness in special graph classes
by: Katona, Gyula Y., et al.
Published: (2018)
by: Katona, Gyula Y., et al.
Published: (2018)
Counting spanning subgraphs in dense hypergraphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
Sharp thresholds for spanning regular subgraphs
by: Zhukovskii, Maksim
Published: (2025)
by: Zhukovskii, Maksim
Published: (2025)
Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)
by: Cooper, Colin, et al.
Published: (2025)
Sets avoiding a rainbow solution to the generalized Schur equation
by: Győri, Ervin, et al.
Published: (2025)
by: Győri, Ervin, et al.
Published: (2025)
On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
On asymptotic values for the minimum number of spanning forests in simple regular graphs
by: Xu, Shaohan, et al.
Published: (2026)
by: Xu, Shaohan, et al.
Published: (2026)
Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)
by: Diskin, Sahar, et al.
Published: (2024)
Color-avoiding percolation in edge-colored Erdős-Rényi graphs
by: Ráth, Balázs, et al.
Published: (2022)
by: Ráth, Balázs, et al.
Published: (2022)
The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)
by: Jaberi, Raed, et al.
Published: (2024)
On the number of small edge-weighted subgraphs
by: Yu, Feng, et al.
Published: (2025)
by: Yu, Feng, et al.
Published: (2025)
Random Turán theorem for expansions of spanning subgraphs of tight trees
by: Nie, Jiaxi
Published: (2023)
by: Nie, Jiaxi
Published: (2023)
From finding a spanning subgraph $H$ to an $H$-factor
by: Lo, Allan
Published: (2025)
by: Lo, Allan
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)
The existence of biregular spanning subgraphs in bipartite graphs via spectral radius
by: Fan, Dandan, et al.
Published: (2024)
by: Fan, Dandan, et al.
Published: (2024)
The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)
by: Ha, Pham Hoang, et al.
Published: (2026)
Unavoidable induced subgraphs of large and infinite $2$-edge-connected graphs
by: Allred, Sarah, et al.
Published: (2025)
by: Allred, Sarah, et al.
Published: (2025)
On the Turán number of the $G_{3\times 3}$ in linear hypergraphs
by: Solymosi, Jozsef
Published: (2025)
by: Solymosi, Jozsef
Published: (2025)
Optimal spread for spanning subgraphs of Dirac hypergraphs
by: Kelly, Tom, et al.
Published: (2023)
by: Kelly, Tom, et al.
Published: (2023)
Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
Spanning tree-connected subgraphs with small degrees
by: Hasanvand, Morteza
Published: (2022)
by: Hasanvand, Morteza
Published: (2022)
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)
by: Chen, Yihan, et al.
Published: (2024)
Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)
by: Hladký, Jan, et al.
Published: (2023)
The number of cliques in hypergraphs with forbidden subgraphs
by: Basu, Ayush, et al.
Published: (2024)
by: Basu, Ayush, et al.
Published: (2024)
Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)
by: Sudakov, Benny
Published: (2024)
Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
Acyclic subgraphs of tournaments with high chromatic number
by: Fox, Jacob, et al.
Published: (2019)
by: Fox, Jacob, et al.
Published: (2019)
The relation between different edge spans of a graph
by: Šubašić, Aljoša, et al.
Published: (2023)
by: Šubašić, Aljoša, et al.
Published: (2023)
Rainbow spanning structures in strongly edge-colored graphs
by: Ding, Laihao, et al.
Published: (2026)
by: Ding, Laihao, et al.
Published: (2026)
Coloring graphs with forbidden almost bipartite subgraphs
by: Anderson, James, et al.
Published: (2022)
by: Anderson, James, et al.
Published: (2022)
Similar Items
-
Color-avoiding connected colorings and orientations
by: Pintér, József, et al.
Published: (2025) -
Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025) -
Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026) -
Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025) -
Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)