Related papers: On positive hypergraphs
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations…
We give a new construction showing that for every $r\ge 3$, there exists an $r$-uniform linear hypergraph on $n$ vertices with $\Theta_r(n^2)$ edges and no copy of the $r\times r$ grid. This complements the works of F\"uredi--Ruszink\'o,…
We say that $\alpha\in [0,1)$ is a jump for an integer $r\geq 2$ if there exists $c(\alpha)>0$ such that for all $\epsilon >0 $ and all $t\geq 1$ any $r$-graph with $n\geq n_0(\alpha,\epsilon,t)$ vertices and density at least…
In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…
Fix a positive integer $n$, a real number $p\in (0,1]$, and a (perhaps random) hypergraph $\mathcal{H}$ on $[n]$. We introduce and investigate the following random multigraph model, which we denote $\mathbb{G}(n,p\, ; \,\mathcal{H})$: begin…
An $r$-uniform hypergraph $H$ consists of a set of vertices $V$ and a set of edges whose elements are $r$-subsets of $V$. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph $H$ if it…
A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963 where they measured the degree of asymmetry of an asymmetric graph. They proved that any…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Gyori and Lovasz independently proved the following beautiful theorem. Let $k\ge2$ be an integer, let $G$ be a $k$-connected graph on $n$ vertices, let $v_1,v_2,\ldots,v_k$ be distinct vertices of $G$ and let $n_1,n_2,\ldots,n_k$ be…
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.
Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all…
A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we…
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges, and even otherwise. Pontus von Br\"omssen (n\'e Andersson) showed that the existence of such an…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…
For a hypergraph $\mathcal{H}$, define the minimum positive codegree $\delta_i^+(\mathcal{H})$ to be the largest integer $k$ such that every $i$-set which is contained in at least one edge of $\mathcal{H}$ is contained in at least $k$…
The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized…
We investigate analytic and geometric implications of non-constant Ricci curvature bounds. We prove a Lichnerowicz eigenvalue estimate and finiteness of the fundamental group assuming that $L+2 Ric$ is a positive operator where $L$ is the…
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…