Saved in:
| Main Authors: | Düzgün, Baran, Riet, Ago-Erik, Taranchuk, Vladislav |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.18418 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Examples of diameter-2 graphs with no triangle or $K_{2,t}$
by: Eberhard, Sean, et al.
Published: (2025)
by: Eberhard, Sean, et al.
Published: (2025)
The maximum spectral radius of $θ_{1,3,3}$-free graphs with given size
by: Gao, Jing, et al.
Published: (2024)
by: Gao, Jing, et al.
Published: (2024)
The maximum spectral radius of $θ_{2,2,3}$-free graphs with given size
by: Gao, Jing, et al.
Published: (2025)
by: Gao, Jing, et al.
Published: (2025)
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
by: Heering, Philipp, et al.
Published: (2026)
by: Heering, Philipp, et al.
Published: (2026)
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)
A spectral extremal problem on non-bipartite triangle-free graphs
by: Li, Yongtao, et al.
Published: (2023)
by: Li, Yongtao, et al.
Published: (2023)
The index of unbalanced signed complete graphs whose negative-edge-induced subgraph is ${K}_{2,2}$-minor free
by: Qin, Mingsong, et al.
Published: (2025)
by: Qin, Mingsong, et al.
Published: (2025)
Recovery Algorithms for Linear Batch Codes
by: Düzgün, Baran, et al.
Published: (2026)
by: Düzgün, Baran, et al.
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)
Induced Turán problem in bipartite graphs
by: Axenovich, Maria, et al.
Published: (2024)
by: Axenovich, Maria, et al.
Published: (2024)
Turán number of books in non-bipartite graphs
by: Miao, Lu, et al.
Published: (2025)
by: Miao, Lu, et al.
Published: (2025)
Spectral radius and rainbow Hamiltonicity in bipartite graphs
by: chen, Meng, et al.
Published: (2026)
by: chen, Meng, et al.
Published: (2026)
Separating path systems for cubic graphs and for complete bipartite graphs
by: Fernandes, Cristina, et al.
Published: (2025)
by: Fernandes, Cristina, et al.
Published: (2025)
Tiling randomly perturbed bipartite graphs
by: Gomez-Leos, Enrique, et al.
Published: (2024)
by: Gomez-Leos, Enrique, et al.
Published: (2024)
Asymmetric list sizes in bipartite graphs
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
The minimum size of 2-connected chordal bipartite graphs
by: Zhang, Licheng, et al.
Published: (2024)
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)
by: Peng, Xing, et al.
Published: (2023)
Spectral Turán problem of non-bipartite graphs: Forbidden books
by: Liu, Ruifang, et al.
Published: (2025)
by: Liu, Ruifang, et al.
Published: (2025)
Spectral extremal problems for non-bipartite graphs without odd cycles
by: Zou, Lantao, et al.
Published: (2025)
by: Zou, Lantao, et al.
Published: (2025)
Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)
by: Yuster, Raphael
Published: (2024)
Turán numbers for non-bipartite graphs and applications to spectral extremal problems
by: Fang, Longfei, et al.
Published: (2024)
by: Fang, Longfei, et al.
Published: (2024)
A note on the sizes of bipartite 1-planar graphs
by: Wang, Guiping
Published: (2025)
by: Wang, Guiping
Published: (2025)
Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
by: Yuan, Xiaoli, et al.
Published: (2023)
by: Yuan, Xiaoli, et al.
Published: (2023)
Exact values for unbalanced Zarankiewicz numbers
by: Chen, Guangzhou, et al.
Published: (2022)
by: Chen, Guangzhou, et al.
Published: (2022)
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)
On the number of triangles in $K_4$-free graphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
A sharp spectral extremal result for general non-bipartite graphs
by: Byrne, John
Published: (2024)
by: Byrne, John
Published: (2024)
Strong spectral stabilities for $C_{2k+1}$-free graphs
by: Zou, Lantao, et al.
Published: (2025)
by: Zou, Lantao, et al.
Published: (2025)
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
by: Heering, Philipp, et al.
Published: (2026)
by: Heering, Philipp, et al.
Published: (2026)
Dense halves in balanced 2-partition of K4-free graphs
by: Xu, Yue, et al.
Published: (2024)
by: Xu, Yue, et al.
Published: (2024)
A polynomial resultant approach to algebraic constructions of extremal graphs
by: Zhang, Tao, et al.
Published: (2021)
by: Zhang, Tao, et al.
Published: (2021)
Uniquely $C_{4}^{+}$-saturated graphs
by: Li, Yuying, et al.
Published: (2024)
by: Li, Yuying, et al.
Published: (2024)
Inducibility in $H$-free graphs and inducibility of Turán graphs
by: Yuster, Raphael
Published: (2025)
by: Yuster, Raphael
Published: (2025)
On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)
by: Kang, Ross J., et al.
Published: (2023)
Spectral bipartite Turan problems on linear hypergraphs
by: She, Chuan-Ming, et al.
Published: (2024)
by: She, Chuan-Ming, et al.
Published: (2024)
Multicolor bipartite Ramsey number of double stars
by: DeCamillis, Gregory, et al.
Published: (2023)
by: DeCamillis, Gregory, 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)
Independent transversals in bipartite correspondence-covers
by: Cambie, Stijn, et al.
Published: (2020)
by: Cambie, Stijn, et al.
Published: (2020)
The maximum number of triangles in $K_{1,s,t}$-free graphs
by: Calbet, Asier, et al.
Published: (2025)
by: Calbet, Asier, et al.
Published: (2025)
Similar Items
-
Examples of diameter-2 graphs with no triangle or $K_{2,t}$
by: Eberhard, Sean, et al.
Published: (2025) -
The maximum spectral radius of $θ_{1,3,3}$-free graphs with given size
by: Gao, Jing, et al.
Published: (2024) -
The maximum spectral radius of $θ_{2,2,3}$-free graphs with given size
by: Gao, Jing, et al.
Published: (2025) -
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
by: Heering, Philipp, et al.
Published: (2026) -
Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs
by: Dong, Zichao, et al.
Published: (2025)