var fDesc=new Array();
fDesc[0] = "The minimal 1-regular matchstick graph is a single graph edge, and the minimal 2-regular graph is an equilateral triangle. The minimal known 4-regular matchstick graph is known as the Harborth graph (Hartsfield and Ringel 1994; Timm) but has not been proven optimal. These are illustrated above and summarized in the table below. The matchstick graphs are implemented in Mathematica as GraphData["Matchstick", n].";

function tShowHide(id, show)
{
	var s = document.getElementById("desc");

	if ((s.innerHTML.length<=212 || show==1) && show!=2)
	{
		s.innerHTML = fDesc[id];
		if (document.getElementById('m1'))
			document.getElementById('m1').style.display='none';
		if (document.getElementById('m2'))
			document.getElementById('m2').style.display='none';
		if (document.getElementById('more_txt'))
			document.getElementById('more_txt').style.display='inline';
	}
	else
	{
		s.innerHTML = '';
	}
}