相关论文: On Geometric Bipartite Graphs with Asymptotically …

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

We introduce a model for random geodesic drawings of the complete bipartite graph $K_{n,n}$ on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$, where we select the vertices in each bipartite class of $K_{n,n}$ with respect to two…

For a graph $G$ with order $2n$ and a perfect matching, let $f(G)$ and $F(G)$ denote the minimum and maximum forcing number of $G$ respectively. Then $0\leq f(G)\leq F(G)\leq n-1$. Liu and Zhang [10] ever proposed a conjecture: $e(G)\geq…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Erd\H{o}s posed the problem of finding conditions on a graph $G$ that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a bipartite subgraph. We generalize this problem to general…

Given any graph $G$, the (adjacency) spread of $G$ is the maximum absolute difference between any two eigenvalues of the adjacency matrix of $G$. In this paper, we resolve a pair of 20-year-old conjectures of Gregory, Hershkowitz, and…

For an integer $k\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+\Omega(m^{(2k+1)/(2k+2)})$…

We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…

We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a…

The limited augmented Zarankiewicz number $z_L(m,n)$ corresponds to 2-edges $(i,j;k,l)$ in a $C_4$-free bipartite graph, each representing a square $(x_i y_j + x_k y_l)^2$. We introduce \emph{3-edges} $(i,j;k,l;p,q)$ representing $(x_i y_j…

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…

A bipartite graph $H = \left(V_1, V_2; E \right)$ with $|V_1| + |V_2| = n$ is semilinear if $V_i \subseteq \mathbb{R}^{d_i}$ for some $d_i$ and the edge relation $E$ consists of the pairs of points $(x_1, x_2) \in V_1 \times V_2$ satisfying…

A graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index $\chi_{\rm irr}'(G)$ of a graph $G$ is the smallest number of locally irregular subgraphs needed to edge-decompose $G$. Not all…

In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained girth and in the high-rate regime. We focus on the relation…

Let g(n) denote the minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (2003) showed that g(n)\geq\ceil{(3n-2)/2}-2 for n\geq 20 and g(n)\leq\ceil{(3n-2)/2} for n\geq 54 as well as for n\in…

We study the problem of finding a minimum $k$-critical-bipartite graph of order $(n,m)$: a bipartite graph $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical-bipartite, and the tuple $(|E|, \Delta_U, \Delta_V)$, where…

In 1982, Tuza 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$. This conjecture was proved for…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore-like…

The binding number $b(G)$ of a graph, introduced by Woodall [J. Combin. Theory, Ser. B, 1973], is a central topic of both structural and extremal graph theory. It is closely related to fundamental combinatorial and structural properties of…

Let $G = (V,w)$ be a weighted undirected graph with $m$ edges. The cut dimension of $G$ is the dimension of the span of the characteristic vectors of the minimum cuts of $G$, viewed as vectors in $\{0,1\}^m$. For every $n \ge 2$ we show…