The minimum number of subgraphs in a graph and its complement

DOI10.1002/JGT.3190160506MaRDI QIDQ4020702zbMATH OpenOpenAlexFDO

Authors Lane Clark

Publication date 17 January 1993

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160506

zbMATH Keywords

2-edge coloringmonochromatic copies

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• A Disproof of a Conjecture of Erdős in Ramsey Theory
• The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
• scientific article; zbMATH DE number 4023316
• Chromatic Ramsey numbers
• Edge disjoint monochromatic triangles in 2-colored graphs

Cited in

(4)

• Graph theory. Abstracts from the workshop held January 2--8, 2022
• On the enumeration of minimal non-pairwise compatibility graphs
• Common graphs with arbitrary chromatic number
• Subgraphs of minimal degree \(k\)

This page was built for publication: The minimum number of subgraphs in a graph and its complement

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