相关论文: Existence of a symmetric bipodal phase in the edge…

We numerically investigate typical graphs in a region of the Strauss model of random graphs with constraints on the densities of edges and triangles. This region, where typical graphs had been expected to be bipodal but turned out to be…

In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…

We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…

We study the asymptotics of large simple graphs constrained by the limiting density of edges and the limiting subgraph density of an arbitrary fixed graph $H$. We prove that, for all but finitely many values of the edge density, if the…

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…

We consider entropy-optimal graphons associated with extreme and near-extreme constraints on the densities of edges and triangles. We prove that the optimizers for near-extreme constraints are unique and multipodal and are perturbations of…

A well-known conjecture by Erd\H{o}s states that every triangle-free graph on $n$ vertices can be made bipartite by removing at most $n^2/25$ edges. This conjecture was known for graphs with edge density at least $0.4$ and edge density at…

We consider the edge-triangle model (or Strauss model), and focus on the asymptotic behavior of the triangle density when the size of the graph increases to infinity. This random graph belongs to the class of exponential random graphs,…

A \emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \leq 4$, Pach and T\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which…

We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\'e and Thomassen characterizing those edge densities guaranteeing the existence of a…

In this paper, we consider an analog of the well-studied extremal problem for triangle-free subgraphs of graphs for uniform hypergraphs. A loose triangle is a hypergraph $T$ consisting of three edges $e,f$ and $g$ such that $|e \cap f| = |f…

Let $\mathcal{T}$ be a finite nonempty set of $3$-element subsets of a totally ordered set $V$. We view $\mathcal{T}$ as the set of triangles in the support graph. Let $\delta_{1,\mathcal{T}}$ be the signed edge-triangle incidence matrix,…

May the $\mathit{triforce}$ be the 3-uniform hypergraph on six vertices with edges $\{123',12'3,1'23\}$. We show that the minimum triforce density in a 3-uniform hypergraph of edge density $\delta$ is $\delta^{4-o(1)}$ but not…

We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied for several graphs…

The triangle-free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal…

Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph…

A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat counterintuitive results concerning the maximum number of edges…

For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…

Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…

An embedding of a graph in $3$-space is linkless if for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. We prove that every bipartite linklessly embeddable (simple)…