Results 31 to 40 of about 58,072 (195)

Generalized Ramsey–Turán density for cliques

Forum of Mathematics, Sigma
We study the generalized Ramsey–Turán function $\mathrm {RT}(n,K_s,K_t,o(n))$ , which is the maximum possible number of copies of $K_s$ in an n-vertex $K_t$ -free graph with independence number $o(n)$ . The case when $s=2$
Jun Gao, Suyun Jiang, Hong Liu, Maya Sankar   +3 more
doaj   +1 more source

Random matchings in linear hypergraphs

Forum of Mathematics, Sigma
For a given hypergraph H and a vertex v∈V(H) $v\in V(H)$ v element of upper V left parenthesis upper H right parenthesis , consider a random matching M chosen uniformly from the set of all matchings in H. $H.$ upper H period In 1995, $1995,$
Hyunwoo Lee
doaj   +1 more source

Pairwise Intersections and Forbidden Configurations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
Let $f_m(a,b,c,d)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $m$-element set for which there is no pair of subsets $A,B \in \mathcal{F}$ with $|A \cap B| \geq a$, $|\bar{A} \cap B| \geq b$, $|A \cap \bar{B}| \geq c$, and $|\bar{A}
Richard P. Anstee, Peter Keevash
doaj   +1 more source

Extremal Permanents of Laplacian Matrices of Unicyclic Graphs

Axioms
The extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable.
Tingzeng Wu, Xiuhong Wang, Xiangshuai Dong   +2 more
doaj   +1 more source

A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems

Forum of Mathematics, Sigma
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds.
Seonghyuk Im, Jaehoon Kim, Joonkyung Lee, Abhishek Methuku   +3 more
doaj   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source

An identity in combinatorial extremal theory [PDF]

, 1990
Ahlswede R, Zhang Z. An identity in combinatorial extremal theory. Advances in Mathematics.
Zhang, Zhen, Ahlswede, Rudolf, Ahlswede, R, Zhang, Z   +3 more
core   +1 more source

Additive energies on discrete cubes

Discrete Analysis, 2023
One definition of additive combinatorics is that it is the study of subsets of (usually Abelian) groups. Two much studied parameters associated with a subset $A$ are the size of its sumset $A+A=\{a+b:a,b\in A\}$ (or the product set $A.A=\{a.b:a,b\in A\}$
Jaume de Dios Pont, Rachel Greenfeld, Paata Ivanisvili, José Madrid   +3 more
doaj   +1 more source

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

Computer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

Uniqueness of near-horizon geometries of rotating extremal AdS(4) black holes [PDF]

, 2009
We consider stationary extremal black hole solutions of the Einstein-Maxwell equations with a negative cosmological constant in four dimensions. We determine all non-static axisymmetric near-horizon geometries and all static near-horizon geometries for ...
Lucietti, James, Kunduri, Hari K.
core   +1 more source