scientific article; zbMATH DE number 1185596

MaRDI QIDQ3838404zbMATH OpenFDO

Authors Suh-Ryung Kim

Publication date 9 August 1998

zbMATH Keywords

acyclic digraphcompetition graphcompetition numbertriangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Competition numbers of graphs with a small number of triangles
• scientific article; zbMATH DE number 434915
• The competition number of a graph with exactly two holes.
• The competition number of a graph with exactly \(h\) holes, all of which are independent

Cited in

(9)

• Competition numbers of graphs with a small number of triangles
• Competitively tight graphs
• The elimination procedure for the competition number is not optimal
• The competition number of a graph having exactly one hole
• On the inequality dk(G) k(G)+1
• On the competition numbers of diamond-free graphs
• The competition number of a graph and the dimension of its hole space
• The competition numbers of ternary Hamming graphs
• scientific article; zbMATH DE number 4187846 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838404)