Jump to content

Talk:Degeneracy (graph theory)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Examples

[edit]

There seems to be a mistake in the last paragraph of "Examples". Having a regular connected component is not a nessecary condition for the graph to be degenerate of the maximum degree. In the source either it is a typo or more likely col(G) doesn't actually stand for the degeneracy of G. To correct, one could state, "More strongly, the degeneracy of a graph equals its maximum vertex degree if and only if at least one subgraph of G is regular of maximum degree. For all other graphs, the degeneracy is strictly less than the maximum degree." — Preceding unsigned comment added by 82.130.77.94 (talk) 14:22, 8 December 2016 (UTC)[reply]

[edit]

Hello fellow Wikipedians,

I have just modified 3 external links on Degeneracy (graph theory). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 06:29, 10 December 2016 (UTC)[reply]

[edit]

Hello fellow Wikipedians,

I have just modified one external link on Degeneracy (graph theory). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 02:55, 8 September 2017 (UTC)[reply]

What is meant by 'essentially the same'?

[edit]

In the article, there is the following line:

"Degeneracy is also known as the k-core number, width, and linkage, and is essentially the same as the coloring number or Szekeres–Wilf number (named after Szekeres and Wilf (1968))."

What is meant by "essentially the same"? Are the numbers equivalent or not? If they are not equivalent, what is the difference?

I think it would make the article more clear to either remove the word 'essentially' or explain the differences. BranAndSceolan (talk) 08:31, 5 July 2023 (UTC)[reply]

I think they are off by one. Degeneracy d means you can greedily color it with d+1 colors, as explained in the body of the article. —David Eppstein (talk) 18:26, 5 July 2023 (UTC)[reply]