bio | website | users.monash.edu.au/~davidwo |
---|---|---|
location | Melbourne | |
age | ||
visits | member for | 2 years, 8 months |
seen | 6 hours ago | |
stats | profile views | 73 |
Associate Professor at Monash University.
Mar 4 |
comment |
the choosing of an independent set in a specific $k$-partite graph
Such an independent set is called an "independent transversal". There is a large literature on this topic, although I have never seen the $\Delta(G)=2$ assumption in this setting. |
Mar 4 |
comment |
a question about Brooks' Theorem for $\Delta =4$
No, it is Brooks' Theorem. |
Mar 4 |
comment |
a question about Brooks' Theorem for $\Delta =4$
Johansson proved that every triangle-free graph with maximum degree $\Delta$ is $O(\Delta/\log\Delta)$-colourable. |
Dec 5 |
awarded | Necromancer |
Oct 2 |
awarded | Yearling |
Oct 2 |
answered | Do there exist sparse graphs with large crossing number? |
Sep 24 |
awarded | Autobiographer |
Jul 8 |
answered | triangles in a graph with specified clique number |
Jul 8 |
answered | An upper bound for number of triangles in a graph |
Mar 27 |
comment |
Genus of the graph $K_{4,2,2,2}$
Here is a paper that seems relevant (based on the title): Said Bettayeb, Quan T. Nguyen, "The genus of the complete multipartite graph and the complete multi-layered graph," aiccsa, pp.1-4, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010, 2010. doi.ieeecomputersociety.org/10.1109/AICCSA.2010.5587024 |
Mar 4 |
awarded | Critic |
Feb 12 |
answered | Big Mono-Chromatic Subgraphs of Vertex 2-Colourings |
Jan 22 |
answered | Finding maximal k-degenerate subgraphs |
Aug 28 |
awarded | Supporter |
Aug 28 |
awarded | Necromancer |
Aug 28 |
answered | Cliques, Paley graphs and quadratic residues |
Aug 28 |
awarded | Editor |
Aug 28 |
revised |
A geometric Ramsey problem
added 181 characters in body |
Aug 28 |
awarded | Teacher |
Aug 28 |
answered | A geometric Ramsey problem |