加载中…
We present some results on the structure of line graphs of triangle-free graphs and a homogenization of the line graph of the universal homogeneous triangle-free graph in a finite relational language with arity 4. This result is relevant to the study of the relational complexity of structures defined by forbidden embeddings.

生成讲解博客的中文版本

生成AI智能校验的中文版本