404 reputation
114
bio website
location
age
visits member for 1 year, 6 months
seen Apr 17 at 0:00

Apr
14
awarded  Popular Question
Apr
6
comment Simplifying Sum of Subsets
Thanks! - This is exactly what I was looking for. I had an understanding for the first case mentioned, but had a hard time thinking about the second.
Apr
6
accepted Simplifying Sum of Subsets
Apr
6
revised Simplifying Sum of Subsets
added 6 characters in body
Apr
6
comment Simplifying Sum of Subsets
Yes - Good call - The function inside does depend on $Y$. I will edit this now.
Apr
6
revised Simplifying Sum of Subsets
edited tags
Apr
6
revised Simplifying Sum of Subsets
edited tags
Apr
6
revised Simplifying Sum of Subsets
edited tags
Apr
6
revised Simplifying Sum of Subsets
edited tags
Apr
6
asked Simplifying Sum of Subsets
Feb
5
accepted Proving the number of subgraphs of $G$ isomorphic to $F$
Feb
5
asked Proving the number of subgraphs of $G$ isomorphic to $F$
Jan
28
accepted $K_{1,3}$ packing in a triangulated planar graph
Jan
26
revised $K_{1,3}$ packing in a triangulated planar graph
edited tags
Jan
25
revised $K_{1,3}$ packing in a triangulated planar graph
edited tags
Jan
25
revised $K_{1,3}$ packing in a triangulated planar graph
edited tags
Jan
25
revised $K_{1,3}$ packing in a triangulated planar graph
edited tags
Jan
24
comment $K_{1,3}$ packing in a triangulated planar graph
Apparently the answer is obtainable without really advance graph theory concepts - We really have been talking about planar graphs, min degree orders, canonical orders, triangulations and k-connectivity, but I can't seem to get a lead on anything using these types of concepts.
Jan
24
revised $K_{1,3}$ packing in a triangulated planar graph
edited tags
Jan
24
comment $K_{1,3}$ packing in a triangulated planar graph
I can't read German... thanks anyway though :)