27
Voted
JGT
2016
9 years 11 months ago
2016
: Let λ2(G) and τ(G) denote the second largest eigenvalue and the maximum number of edge-disjoint spanning trees of a graph G, respectively. Motivated by a question of Seymour on...
JGT
2016
9 years 11 months ago
2016
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with eO( √ log log n) colors such that the edges spanned by every set of five vertices receive at...
JGT
2016
9 years 11 months ago
2016
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contrac...
28
Voted
JGO
2016
9 years 11 months ago
2016
20
Voted
JGO
2016
9 years 11 months ago
2016
The study of matrix inequalities in a dimension-free setting is in the realm of free real algebraic geometry (RAG). In this paper we investigate constrained trace and eigenvalue op...
19
Voted
JGO
2016
9 years 11 months ago
2016
In this paper we propose a scalarization proximal point method to solve multiobjective unconstrained minimization problems with locally Lipschitz and quasiconvex vector functions....
JGAA
2016
9 years 11 months ago
2016
JGAA
2016
9 years 11 months ago
2016
JGAA
2016
9 years 11 months ago
2016
JGAA
2016
9 years 11 months ago
2016
