Welcome to MathOverflow

Question

0

1

Hi,

Does anyone know that what is co spanning tree. If there are some good answers then it would be really good to have an example also.

Thanks

flag	asked Oct 4 2011 at 14:02 unknown (yahoo) 3

1

Can you explain in what context this term came up? – Sebastian Meinert Oct 4 2011 at 14:11

3

I would guess that it has to do with matroid duality, where the convention is to prefix everything in the dual with a co. So a cobasis is a basis in the dual, a cocircuit is a circuit in the dual, etc. If you regard a spanning tree as a basis for the graphic matroid, then a cospanning tree is just a basis in the dual, namely the complement of a spanning tree. I think it is time that someone invented the matroid term conut, so that a conut in the dual would be a... – Tony Huynh Oct 4 2011 at 14:24

Brendan McKay · Answer 1 · 2011-10-06 23:32:31Z UTC

2

The paper here uses this name for the complement of a spanning tree, i.e. the set of edges which do not lie in some given spanning tree.

answered Oct 6 2011 at 23:32

Brendan McKay
9,111●1●13●33

1

That is also what I would expect it to mean. It is pretty much the same as Tony Huynh's comment: the complement of a spanning tree is a base for the dual matroid. If the given graph is planar, it is (the set of edges that dualize to) a spanning tree of the dual graph. – David Eppstein Oct 7 2011 at 16:10

rve · Answer 2 · 2013-05-06 02:41:38Z UTC

0

If G = (V, E) has a spanning tree T = (V, E1), the cospanning tree of T is a spanning subgraph of G, defined by (V, E-E1).

answered May 6 at 2:41

rve
1

co spanning tree

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

2 Answers

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.