User contributions
- 10:12, 24 February 2010 (diff | hist) . . (0) . . Frank-Jordán theorem
- 11:24, 27 January 2010 (diff | hist) . . (+644) . . Constructive characterization of dumpy graphs
- 10:53, 16 November 2009 (diff | hist) . . (+1) . . Constructive characterization of dumpy graphs
- 10:52, 16 November 2009 (diff | hist) . . (-10) . . Constructive characterization of dumpy graphs
- 10:49, 16 November 2009 (diff | hist) . . (+780) . . N Constructive characterization of dumpy graphs (Created page with '<onlyinclude> Find a constructive characterization of k-dumpy graphs. </onlyinclude> ==Remarks== The ''k=2'' case has a motivation from rigidity. Let ''G=(V,E…')
- 10:46, 16 November 2009 (diff | hist) . . (+238) . . N Dumpy graph (Created page with '==Dumpy graphs== A rooted digraph is called ''k''-dumpy if every non-root node has indegree ''k'' and every non-singleton set not containing the root has indegree at least ''k+1'…')
- 10:39, 16 November 2009 (diff | hist) . . (+336) . . N Sparse graphs (Created page with '==Sparse graphs== For positive integers k and l a graph ''G=(V,E)'' is called <math>(k,l)</math>-sparse if <math>i(X)\leq k|X|-l</math> holds for every <math>X\subseteq V</math>,…')
- 11:43, 31 October 2009 (diff | hist) . . (+10) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:40, 31 October 2009 (diff | hist) . . (+10) . . In-degree bounded directed forests
- 11:39, 31 October 2009 (diff | hist) . . (+2) . . In-degree bounded directed forests
- 11:37, 31 October 2009 (diff | hist) . . (+45) . . In-degree bounded directed forests
- 11:35, 31 October 2009 (diff | hist) . . (+512) . . N In-degree bounded directed forests (Created page with '<onlyinclude> The digraph $D=(V,A)$ is the union of $k$ directed forests and $\varrho(v)\leq kl$ for each $v\in V$. Is it true that $D$ can be partitioned into $k$ forests $F_1,.…')
- 11:31, 31 October 2009 (diff | hist) . . (-504) . . Independent arborescences in acyclic digraphs
- 11:30, 31 October 2009 (diff | hist) . . (+189) . . Independent arborescences in acyclic digraphs
- 11:28, 31 October 2009 (diff | hist) . . (+1) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:27, 31 October 2009 (diff | hist) . . (+163) . . Independent arborescences in acyclic digraphs
- 11:22, 31 October 2009 (diff | hist) . . (+28) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:21, 31 October 2009 (diff | hist) . . (+3) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:20, 31 October 2009 (diff | hist) . . (+16) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:19, 31 October 2009 (diff | hist) . . (+299) . . Independent arborescences in acyclic digraphs (→Remarks)
- 11:13, 31 October 2009 (diff | hist) . . (+2,186) . . Independent arborescences in acyclic digraphs
- 10:56, 31 October 2009 (diff | hist) . . (0) . . Kriesell's conjecture (→Remarks)
- 10:55, 31 October 2009 (diff | hist) . . (+151) . . Kriesell's conjecture (→Remarks)
- 10:05, 31 October 2009 (diff | hist) . . (-21) . . Kriesell's conjecture (→Remarks)
- 10:04, 31 October 2009 (diff | hist) . . (-618) . . Kriesell's conjecture (→Remarks)
- 09:53, 31 October 2009 (diff | hist) . . (+139) . . Kriesell's conjecture (→Remarks)
- 09:49, 31 October 2009 (diff | hist) . . (-1) . . Kriesell's conjecture (→Remarks)
- 09:48, 31 October 2009 (diff | hist) . . (+9) . . Kriesell's conjecture (→Remarks)
- 09:44, 31 October 2009 (diff | hist) . . (+32) . . Egres:Old problems (→Régi problémák) (current)
- 09:43, 31 October 2009 (diff | hist) . . (-37) . . Kriesell's conjecture (→Remarks)
- 09:42, 31 October 2009 (diff | hist) . . (+13) . . Kriesell's conjecture (→Remarks)
- 09:42, 31 October 2009 (diff | hist) . . (0) . . Kriesell's conjecture (→Remarks)
- 09:41, 31 October 2009 (diff | hist) . . (+23) . . Kriesell's conjecture (→Remarks)
- 09:39, 31 October 2009 (diff | hist) . . (+21) . . Kriesell's conjecture
- 09:19, 31 October 2009 (diff | hist) . . (+3,488) . . Kriesell's conjecture
- 14:37, 28 August 2009 (diff | hist) . . (+95) . . Egres:Old problems
