|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Almost All Regular Graphs are Normal | | Seyed Saeed Changiz Rezaei
; Seyyed Aliasghar Hosseini
; Bojan Mohar
; | | Date: |
24 Nov 2015 | | Abstract: | In 1999, De Simone and K"{o}rner conjectured that every graph without
induced $C_5,C_7,overline{C}_7$ contains a clique cover $mathcal C$ and a
stable set cover $mathcal I$ such that every clique in $mathcal C$ and every
stable set in $mathcal I$ have a vertex in common. This conjecture has roots
in information theory and became known as the Normal Graph Conjecture. Here we
prove that all graphs of bounded maximum degree and sufficiently large odd
girth (linear in the maximum degree) are normal. This implies that for every
fixed $d$, random $d$-regular graphs are a.a.s. normal. | | Source: | arXiv, 1511.7591 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER