Talk:Connectivity (graph theory)

message: Could somebody kindly provide information on different categories of connectivity, such as 'weakly connected graph', 'strongly connected graph' etc..?
:As I understand it, these two terms refer to directed graphs; I've added the definitions I know.JLeander 23:47, 2 February 2006 (UTC)
thread_title: Untitled

message: It would be nice to have some figures in here, wouldn't it?  Maybe I will cook some up at some point using xfig.JLeander 23:47, 2 February 2006 (UTC)
thread_title: Figures

message: An earlier version of the page had a reference to "Fulkerson's theorem."  My MathSciNet search didn't turn up any appropriate result known by this name.  My guess is that the previous editor had max-flow/min-cut in mind---or am I missing something?JLeander 23:47, 2 February 2006 (UTC)
thread_title: Fulkerson's theorem

message: What's the name for a digraph such that for each pair of vertices u,v, there is either a path from u to v or a path from v to u? I'd call it just connected, since this is an intermediate property between weak and strong connectivity, and is in fact equivalent to the existence of a path containing all vertices. However, I'm not an expert of the subject, and I was unable to find any reference about this, so far. fudo (questions?) 17:35, 27 April 2007 (UTC)
thread_title:  Question about digraphs 

message: *A connected component is a maximal connected subgraph of G.
**Please define the maximal in maximal connected subgraph. Thanks, --Abdull (talk) 15:27, 27 July 2008 (UTC)
thread_title:  Maximal 

message: "A complete graph with n vertices has no cuts at all, but by convention its connectivity is n-1."  Agreed, except that everyone considers K1 to be connected.  I think that means its connectivity is 1, not 0.  Agreed?  McKay (talk) 07:43, 8 March 2009 (UTC)
thread_title:  complete graphs 

message: The article's statement of Menger's theorem (the final paragraph of the Menger's theorem section) appears to me to be trivially false, and different from the statement given at Menger's theorem. Maproom (talk) 16:32, 5 November 2010 (UTC)
thread_title:  Menger's theorem 

message: Hello fellow Wikipedians,
I have just modified one external link on Connectivity (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:
*Added archive https://web.archive.org/web/20100611212234/http://www.cs.uchicago.edu/files/tr_authentic/TR-94-10.ps to http://www.cs.uchicago.edu/files/tr_authentic/TR-94-10.ps
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
Cheers.—InternetArchiveBot (Report bug) 06:10, 12 August 2017 (UTC)
thread_title:  External links modified 

message: The new article Meshulam game concerns a theorem about the connectivity of a graph, in particular, a bound relating the connectivity to the outcome of a certain game on the graph.  I am skeptical that the game is sufficiently notable to merit a full article.  However, it is short and could fit nicely as a section in this article.  What do others think? JBL (talk) 20:32, 31 July 2020 (UTC)
replies: text: As far as I understand from the references, this game is about the standard notion of graph connectivity - it is about the homological connectivity of a graph. It may be better to merge it to that page. I am still working on these issues. --Erel Segal (talk) 20:04, 1 August 2020 (UTC)

text: Better not. The "game" is a separate well defined (sub)subject. My very best wishes (talk) 18:41, 12 December 2020 (UTC)
thread_title:  Proposed merge of [[Meshulam game]] into [[Connectivity (graph theory)]]