Results 31 to 40 of about 538 (183)

On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number

Discrete Dynamics in Nature and Society, 2022
A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m-uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral ...
Lei Zhang, Haizhen Ren
doaj   +1 more source

Covering Non-uniform Hypergraphs

Journal of Combinatorial Theory, Series B, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster   +3 more
openaire   +2 more sources

An abstract approach to polychromatic coloring: Shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes

Journal of Computational Geometry, 2019
The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets.
Balázs Keszegh, Dömötör Pálvölgyi
doaj   +1 more source

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs

International Journal of Mathematics and Mathematical Sciences, 2005
In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj   +1 more source

Domination game on uniform hypergraphs [PDF]

Discrete Applied Mathematics, 2019
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the set of vertices dominated so far. The game is over if all vertices of $\mathcal{H}$ are dominated.
Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer   +3 more
openaire   +5 more sources

Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures

Axioms
This paper continues the study of second-order signature properties—the characterization of the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform hypergraphs.
Evgeniya Egorova, Vladislav Leonov, Aleksey Mokryakov, Vladimir Tsurkov   +3 more
doaj   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Recursively Constructed Uniform Hypergraphs

Algorithms
In this work, we introduce and study a generalization for r-uniform hypergraphs of complement-reducible graphs, the so-called co-graphs. The operations for r-join-hypergraphs are the binary disjoint union of two given r-join-hypergraphs and the r-nary ...
Frank Gurski, Jochen Rethmann, Egon Wanke   +2 more
doaj   +1 more source

A note on self-complementary hypergraphs [PDF]

Opuscula Mathematica, 2005
In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj  

Self-complementing permutations of k-uniform hypergraphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2009
Graphs and ...
Artur Szymański, Adam Pawel Wojda
doaj   +1 more source