Jump to content

Bipartite graph: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

21 October 2024

20 October 2024

26 August 2024

18 August 2024

17 August 2024

14 August 2024

16 July 2024

13 July 2024

27 May 2024

6 April 2024

5 April 2024

5 February 2024

9 November 2023

24 October 2023

19 August 2023

27 May 2023

13 May 2023

4 February 2023

1 February 2023

29 January 2023

22 January 2023

2 January 2023

  • curprev 18:5918:59, 2 January 2023 Pingiunul talk contribs 33,374 bytes +276 Characterization: Clarified that bipartitness equivalence to absence of odd-length cycle only applies to undirected graphs. For directed graphs, the source I gave lists a simple counterexample: "he obvious extension of this statement to cycles in digraphs is not valid (the non-bipartite digraph with vertex set {x, y, z} and arc set {xy, xz, yz}". undo

22 November 2022

23 October 2022

15 October 2022

18 September 2022

15 August 2022

22 May 2022

23 February 2022

  • curprev 14:4414:44, 23 February 2022 Antchal talk contribs 32,806 bytes −1 Isn't it best of both worlds now? If I pretend that I don't know definition of "independent set", to me the original version feels like the line after "such that" is imposing additional constraints on the disjoint independent sets which isn't actually the case here. Maybe someone can better rephrase my edit/intention to clear the message. undo

22 February 2022

  • curprev 17:5517:55, 22 February 2022 David Eppstein talk contribs 32,807 bytes +132 Undid revision 1073388272 by Antchal (talk) Maybe unnecessary to someone who already understands the "independent set" jargon, but how likely is it that someone would understand that and simultaneously not already know what a bipartite graph is? That is, for which readers do you expect your version of the lead to actually be helpful? undo Tag: Undo
  • curprev 13:3113:31, 22 February 2022 Antchal talk contribs 32,675 bytes −132 The deleted lines were unnecesary since independent set, by definition, tells that all the edges are incident on exactly 1 vertex of U and V. undo Tag: Reverted

9 February 2022

28 January 2022

23 January 2022

1 January 2022

24 December 2021

9 November 2021

20 October 2021

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)