Related papers: On MaxCut and the Lov\'asz theta function
Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to find a subset of k vertices such that the sum of the edge weights in the corresponding subgraph is maximized. The problem is known to be NP-hard, and is also very…
A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…
Edmonds, Lov\'asz, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjecture: if a matching covered graph has a nontrivial tight cut…
For an $r$-uniform hypergraph $H$, let $\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\tau^{(m)}(H)$ denote the minimum size of a collection…
In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent $\beta$. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes…
We present a polynomial-time $(\alpha_{GW} + \varepsilon)$-approximation algorithm for the Maximum Cut problem on interval graphs and split graphs, where $\alpha_{GW} \approx 0.878$ is the approximation guarantee of the Goemans-Williamson…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
In this note, we improve the lower bounds for the maximum size of the $k$th largest eigenvalue of the adjacency matrix of a graph for several values of $k$. In particular, we show that closed blowups of the icosahedral graph improve the…
We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\dots, C(n)$ for…
We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…
P. Erd\H{o}s, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{k+1}$, which have order $n$ and minimum degree $\delta$.…
Given a graph $H$ and a set of graphs $\mathcal F$, let $ex(n,H,\mathcal F)$ denote the maximum possible number of copies of $H$ in an $\mathcal F$-free graph on $n$ vertices. We investigate the function $ex(n,H,\mathcal F)$, when $H$ and…
Tuza (1981) conjectured that the size $\tau(G)$ of a minimum set of edges that intersects every triangle of a graph $G$ is at most twice the size $\nu(G)$ of a maximum set of edge-disjoint triangles of $G$. In this paper we present three…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of…
Erd\H{o}s and Simonovits asked the following question: For an integer $r\geq 2$ and a family of non-bipartite graphs $\mathcal{H}$, determine the infimum of $\alpha$ such that any $\mathcal{H}$-free $n$-vertex graph with minimum degree at…
A classic result of Erd\H{o}s and P\'osa says that any graph contains either $k$ vertex-disjoint cycles or can be made acyclic by deleting at most $O(k \log k)$ vertices. Here we generalize this result by showing that for all numbers $k$…
Non-commutative graph theory is an operator space generalization of graph theory. Well known graph parameters such as the independence number and Lov\'asz theta function were first generalized to this setting by Duan, Severini, and Winter.…
A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound…