1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2024
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
Yihan Chen, Jialin He, Allan Lo +3
In 1975 Bollobás, Erdős, and Szemerédi asked what minimum degree guarantees an octahedral subgraph in any tripartite graph with vertices in each vertex class. We s…
math.CO2023★ 1 cited
On the maximum number of edges in k-critical graphs
Cong Luo, Jie Ma, Tianchi Yang
A graph is called -critical if its chromatic number is but any proper subgraph has chromatic number less than . An old and important problem in graph theory asks to deter…