Saved in:
| Main Author: | Theodorakopoulos, Stefanos |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.02864 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Turán number of complete bipartite graphs with bounded matching number
by: Luo, Huan, et al.
Published: (2024)
by: Luo, Huan, 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)
On quadratic embeddability of bipartite graphs and theta graphs
by: Młotkowski, Wojciech, et al.
Published: (2024)
by: Młotkowski, Wojciech, 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)
Non-bipartite graphs without theta subgraphs
by: Fang, Longfei, et al.
Published: (2025)
by: Fang, Longfei, 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)
A sharp lower bound on the generalized 4-independence number
by: Huang, Jing
Published: (2025)
by: Huang, Jing
Published: (2025)
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 conditional lower bound for the Turán number of spheres
by: Newman, Andrew, et al.
Published: (2024)
by: Newman, Andrew, et al.
Published: (2024)
On Turán problems with bounded matching number
by: Gerbner, Dániel
Published: (2022)
by: Gerbner, Dániel
Published: (2022)
A sharp upper bound for the number of connected sets in any grid graph
by: Ma, Hongxia, et al.
Published: (2025)
by: Ma, Hongxia, et al.
Published: (2025)
On hypergraph Turán problems with bounded matching number
by: Gerbner, Dániel, et al.
Published: (2024)
by: Gerbner, Dániel, et al.
Published: (2024)
Turán number of complete multipartite graphs in multipartite graphs
by: Han, Jie, et al.
Published: (2024)
by: Han, Jie, et al.
Published: (2024)
Spectral Turán problem of non-bipartite graphs: Forbidden books
by: Liu, Ruifang, et al.
Published: (2025)
by: Liu, Ruifang, et al.
Published: (2025)
A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network
by: Semple, Charles, et al.
Published: (2025)
by: Semple, Charles, et al.
Published: (2025)
A Lovász theta lower bound on Quantum Max Cut
by: Huber, Felix
Published: (2025)
by: Huber, Felix
Published: (2025)
The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)
by: Ho, Boon Suan
Published: (2026)
The distinguishing number of complete bipartite and crown graphs
by: Chen, Lei, et al.
Published: (2026)
by: Chen, Lei, et al.
Published: (2026)
The linear Turán number of the 3-graph $P_5$
by: Tang, Chaoliang, et al.
Published: (2026)
by: Tang, Chaoliang, et al.
Published: (2026)
On the Turán number of odd-ballooning of $3$-chromatic graphs
by: Fang, Longfei, et al.
Published: (2025)
by: Fang, Longfei, et al.
Published: (2025)
On $\mathcal{F}$-multicolor Turán number of hypergraph graphs
by: Li, Ping
Published: (2025)
by: Li, Ping
Published: (2025)
Sharp lower bounds and extremal graphs for the generalized $k$-independence number
by: Huang, Jing, et al.
Published: (2025)
by: Huang, Jing, et al.
Published: (2025)
New lower bounds on the non-repetitive chromatic number of some graphs
by: Tao, Tianyi, et al.
Published: (2025)
by: Tao, Tianyi, et al.
Published: (2025)
A hypergraph bipartite Turán problem with odd uniformity
by: Ma, Jie, et al.
Published: (2024)
by: Ma, Jie, et al.
Published: (2024)
On generalized Turán problems with bounded matching number
by: Xue, Yisai, et al.
Published: (2024)
by: Xue, Yisai, et al.
Published: (2024)
Triple systems with bounded matching number: some constructions and exact Turán number
by: Chen, Nannan, et al.
Published: (2025)
by: Chen, Nannan, et al.
Published: (2025)
Hypergraph Turán problem of the generalized triangle with bounded matching number
by: Wang, Jian, et al.
Published: (2025)
by: Wang, Jian, et al.
Published: (2025)
Weak saturation numbers of large complete bipartite graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)
by: Akhmejanova, Margarita, et al.
Published: (2025)
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
by: Abreu, M., et al.
Published: (2024)
by: Abreu, M., et al.
Published: (2024)
The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)
by: Dong, Changchang, et al.
Published: (2024)
An asymptotic lower bound on the number of polyominoes
by: Bui, Vuong
Published: (2022)
by: Bui, Vuong
Published: (2022)
Generalized Turán problem with bounded matching number
by: Ma, Yue, et al.
Published: (2023)
by: Ma, Yue, et al.
Published: (2023)
On multicolor Turán numbers
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
On the Turán number of the hypercube
by: Janzer, Oliver, et al.
Published: (2022)
by: Janzer, Oliver, et al.
Published: (2022)
Turán numbers of cycles plus a general graph
by: Dou, Chunyang, et al.
Published: (2024)
by: Dou, Chunyang, et al.
Published: (2024)
A sharp spectral extremal result for general non-bipartite graphs
by: Byrne, John
Published: (2024)
by: Byrne, John
Published: (2024)
Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)
by: Das, Biswajit, et al.
Published: (2025)
An improved upper bound for planar Turán number of double star $S_{2,5}$
by: Xu, Xin, et al.
Published: (2024)
by: Xu, Xin, et al.
Published: (2024)
The inducibility of Turán graphs
by: Liu, Xizhi, et al.
Published: (2026)
by: Liu, Xizhi, et al.
Published: (2026)
Balanced supersaturation and Turan numbers in random graphs
by: Jiang, Tao, et al.
Published: (2022)
by: Jiang, Tao, et al.
Published: (2022)
Similar Items
-
Turán number of complete bipartite graphs with bounded matching number
by: Luo, Huan, et al.
Published: (2024) -
Turán number of books in non-bipartite graphs
by: Miao, Lu, et al.
Published: (2025) -
On quadratic embeddability of bipartite graphs and theta graphs
by: Młotkowski, Wojciech, et al.
Published: (2024) -
Turán number of the odd-ballooning of complete bipartite graphs
by: Peng, Xing, et al.
Published: (2023) -
Non-bipartite graphs without theta subgraphs
by: Fang, Longfei, et al.
Published: (2025)