The Harries–Wong graph is a specific type of graph used in combinatorial mathematics and graph theory. It is particularly known for being a counterexample to certain conjectures in graph theory, especially related to the properties of extremal graphs—graphs that maximize or minimize a particular property under specified conditions. The graph is constructed using a specific method and has been researched for its unique characteristics in the context of colorings, coverings, and other properties.
New to topics? Read the docs here!