2 citations · 2 across the 15 of their papers we have counts for
7 papers · 1 filter
Proper -edge-weightings of trees
Péter Madarasi
Let and be distinct real weights. An -edge-weighting of a tree assigns one of these weights to each edge and is proper if adjacent vertices have different sums of…
Polytopes of alternating sign matrices with dihedral symmetries
Péter Madarasi
We study the convex hulls of alternating sign matrices invariant under subgroups of the dihedral group of the square. For each non-trivial symmetry class, the symmetry…
Separable convex optimization over indegree polytopes
Nóra A. Borsik, Péter Madarasi
We study separable discrete convex optimization over indegree vectors of orientations of an undirected graph, focusing on the effect of imposing acyclicity. Since the extreme point…
Vertex-ordering and arc-partitioning problems
Nóra A. Borsik, Péter Madarasi
We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intrigui…
Prefix-bounded matrices
Nóra A. Borsik, András Frank, Péter Madarasi +1
By unifying various earlier extensions of alternating sign matrices (ASMs), we introduce the notion of prefix-bounded matrices (PBMs). It is shown that the convex hull of these mat…
The Ramsey number of a long cycle and complete graphs
Péter Madarasi
In this paper, we prove that the multicolored Ramsey number is at least for arbitrary connected graphs and $…
Matchings under distance constraints I
Péter Madarasi
This paper introduces the \emph{-distance matching problem}, in which we are given a bipartite graph with , a weight function on the edges and a…