Vinicius dos Santos
Reputation
243
Top tag
Next privilege 250 Rep.
 Dec 26 answered Partitioning the vertex set of a planar bipartite graph into a tree and an independent set Nov 5 awarded Scholar Nov 5 accepted Maximum number of hyperedges on a hypergraph without a spanning tree Nov 4 revised Maximum number of hyperedges on a hypergraph without a spanning tree deleted 3 characters in body Nov 4 comment Maximum number of hyperedges on a hypergraph without a spanning tree That's it. Thank you, @BenBarber. Nov 3 awarded Student Nov 3 asked Maximum number of hyperedges on a hypergraph without a spanning tree Feb 4 comment Making a graph claw-free by adding as few edges as possible I have no clue, but it is definitely harder that the general case. Feb 4 comment Making a graph claw-free by adding as few edges as possible It is hard to know how common they are, but it is easy to find many graphs with a "hidden star" like the idea above, implying large gaps between the original graph and the augmentation. Feb 4 awarded Yearling Feb 3 revised Making a graph claw-free by adding as few edges as possible Typo Feb 3 answered Making a graph claw-free by adding as few edges as possible Jan 31 answered Upper-bound for maximal-cliques on perfect graphs Jan 10 awarded Editor Jan 10 revised Careers advice for Ph.D.s without current postdocs or university jobs added 12 characters in body Jan 10 answered Careers advice for Ph.D.s without current postdocs or university jobs Nov 16 answered Are there any non-planar graphs containing only K(3,3) as a subgraph that are not 4-colourable? Feb 29 awarded Supporter Feb 2 answered Bounds on number of simple paths in graph Oct 18 comment Decomposition of graphs as symmetric differences of copies of $K_{a,b}$ I found your idea of decomposition very interesting. A similar idea would be to consider just complete graphs instead of bipartite complete graphs. Finally, you should consider posting this question on cstheory Q&A site. Maybe you can have more luck finding an answer there.