相关论文: Grid-Based Graphs, Linear Realizations and the Bur…

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…

A subgraph $H$ of a multigraph $G$ is overfull if $ |E(H) | > \Delta(G) \lfloor |V(H)|/2 \rfloor$. Analogous to the Overfull Conjecture proposed by Chetwynd and Hilton in 1986, Stiebitz et al. in 2012 formed the multigraph version of the…

We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…

We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…

A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational $r$ between $1$ and $2$ there is a graph $H$ such that the largest number of edges in an $H$-free graph on $n$ vertices is $\Theta(n^r)$. Answering a…

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$…

A well-known theorem of Erd\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2}(k-1)n$ edges. Recently Gy\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining…

Given a finite grid in $\mathbb{R}^2$, how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We…

A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\theta$, defining the…

We prove three results conjectured or stated by Chartrand, Fink and Zhang [European J. Combin {\bf 21} (2000) 181--189, Disc. Appl. Math. {\bf 116} (2002) 115--126, and pre-print of ``The hull number of an oriented graph'']. For a digraph…

The Tur\'{a}n number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\mathcal{F}$ of graphs, the suspension $\mathcal{F}+v$…

Summarizing graphs w.r.t. structural features is important to reduce the graph's size and make tasks like indexing, querying, and visualization feasible. Our generic parallel BRS algorithm efficiently summarizes large graphs w.r.t. a custom…

The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

Ryser conjectured that $\tau\le(r-1)\nu$ for $r$-partite hypergraphs, where $\tau$ is the covering number and $\nu$ is the matching number. We prove this conjecture for $r\le9$ in the special case of linear intersecting hypergraphs, in…

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

Let $B$ be a bidirected multigraph with signing $\sigma$, let $X$ be a set of vertices in $B$, and let $k$ be a non-negative integer. For any pair of vertex sets $S,T\subset V(B)$ satisfying $X\cap S = X\cap T$, we denote by $B_{S,T}$ the…

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, Erd\H{o}s and S\'os [New directions in the theory of graphs (Proc. Third…

One of possible interpretations of the well-known K\"onig--Hall--Egerv\'ary theorem is a full characterization of all bipartite graphs extremal for fractional matchings of a given weight (or, equivalently, a characterization of…