a major unproven conjecture in graph theory is the graceful tree conjecture or ringel–kotzig conjecture, named after gerhard ringel and anton kotzig, which hypothesizes that all trees are graceful. the ringel–kotzig conjecture is also known as the "graceful labeling conjecture". kotzig once called the effort to prove the conjecture a "disease".