Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference31 articles.
1. Alon N, Spencer JH (2008) The probabilistic method, Wiley-Interscience series in discrete mathematics and optimization, 3rd edn. Wiley, New York
2. Balogh J, Keevash P, Sudakov B (2006) On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J Combin Theory Ser B 96(6):919–932
3. Baron JD (2016) Two problems on cycles in random graphs. PhD thesis, Rutgers University-Graduate School-New Brunswick
4. Bennett P, Dudek A, Zerbib S (2020) Large triangle packings and Tuza’s conjecture in sparse random graphs. Combin Probab Comput 29(5):757–779
5. Botler F, Fernandes CG, Gutiérrez J (2018) On Tuza’s conjecture for graphs with treewidth at most 6. In: Anais do III Encontro de Teoria da Computação. SBC