Strong Pseudo Transitivity and Intersection Graphs

zbMath1426.05057arXiv1806.01378MaRDI QIDQ5224759

Farhad Shahrokhi

Publication date: 24 July 2019

Full work available at URL: https://arxiv.org/abs/1806.01378

zbMATH Keywords

maximum independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Strong Pseudo Transitivity and Intersection Graphs