Results 181 to 190 of about 728,495 (209)
Some of the next articles are maybe not open access.
Intersection Multigraphs of Uniform Hypergraphs
Graphs and Combinatorics, 1998A hypergraph \(H=(V,\{X_i \mid i\in I\})\) is \(k\)-uniform if all hyperedges \(X_i\) have the same cardinality \(k\); it is \(k\)-conformal if there is some graph \(G\) such that \(H\) is isomorphic to the hypergraph of all cliques with \(k\) vertices of \(G\).
Erich Prisner
exaly +3 more sources
On the Turán Density of Uniform Hypergraphs
Acta Mathematicae Applicatae Sinica, English Series, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, An, Gao, Guo-rong
openaire +2 more sources
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 +2 more
exaly +6 more sources
Hypergraphs with a Quarter Uniform Turán Density
Journal of the Operations Research Society of ChinaInternational audienceThe uniform Turán density of a -uniform hypergraph is the supremum over all for which there is an -free hypergraph with the property that every linearly sized subhypergraph with density at least .
Wenling Zhou, Guang-Hui Wang
exaly +2 more sources
Learning a hidden uniform hypergraph
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang +2 more
openaire +3 more sources
On random sampling in uniform hypergraphs
Random Structures & Algorithms, 2011AbstractA k‐graph \documentclass{article} \usepackage{amsmath,amsfonts,mathrsfs,amssymb}\pagestyle{empty}\begin{document} ${\mathcal{G}}^{(k)}$ \end{document} on vertex set [n] = {1,…,n} is said to be (ρ,ζ)‐uniform if every S ⊆ [n] of size s = |S| > ζn spans (ρ ± ζ)\documentclass{article} \usepackage{amsmath,amsfonts,mathrsfs,amssymb}\pagestyle ...
Andrzej Czygrinow, Brendan Nagle
openaire +2 more sources
Partitioning dense uniform hypergraphs
Journal of Combinatorial Optimization, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shufei Wu, Jianfeng Hou
openaire +1 more source
2-Colorings of uniform hypergraphs
Mathematical Notes, 2016One of the most popular and classical extremal problems in hypergraph theory is the property of the existence \(2\)-coloring of its vertex set such that no hyper-edge of the hypergraph concerned is monochromatic. Certain bounds for the least number \(m(n)\) of edges of an \(n\)-uniform hypergraph with this property have been determined in the recent ...
Demidovich, Yu. A., Raigorodskii, A. M.
openaire +2 more sources
Matching in 3-uniform hypergraphs
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Zhang, Mei Lu
openaire +1 more source
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs.
Australas. J Comb., 2014In this paper we consider the problem of determining all values of v for which there exists a decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies of a given 3-uniform hypergraph. We solve the problem for each 3-uniform hypergraph having at most three edges and at most six vertices, and for the 3-uniform hypergraph
Bryant, Darryn +3 more
openaire +2 more sources