Results 191 to 200 of about 1,981 (215)

Learning a hidden uniform hypergraph

Optimization Letters, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih   +2 more
openaire   +2 more sources

Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. [PDF]

Australas. J Comb., 2014
In 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, Herke, Sarada, Maenhaut, Barbara, Wannasit, Wannasiri   +3 more
openaire   +1 more source

On random sampling in uniform hypergraphs

Random Structures & Algorithms, 2011
AbstractA 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

2-Colorings of uniform hypergraphs

Mathematical Notes, 2016
One 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

Greedy colorings of uniform hypergraphs

Random Structures & Algorithms, 2009
AbstractWe give a very short proof of an Erdős conjecture that the number of edges in a non‐2‐colorable n‐uniform hypergraph is at least f(n)2n, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least clog n. With an ingenious recoloring idea he later proved that f(n) ≥ cn1/3+o(1). Here we prove a weaker
openaire   +2 more sources

Partitioning dense uniform hypergraphs

Journal of Combinatorial Optimization, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shufei Wu, Jianfeng Hou
openaire   +1 more source

Matching in 3-uniform hypergraphs

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Zhang, Mei Lu
openaire   +1 more source

On Sombor Index for Uniform Hypergraphs

Match Communications in Mathematical and in Computer Chemistry
Summary: The Sombor index for graphs is given by \textit{I. Gutman} [MATCH Commun. Math. Comput. Chem. 86, No. 1, 11--16 (2021; Zbl 1474.92154)]. Since hypergraphs can more accurately describe certain chemical scenarios. Then it has been proposed to generalize the Sombor index from graphs to hypergraphs. Recently, \textit{S. S. Shetty} and \textit{K. A.
Li, Zhuanzhuan, Shi, Liyuan, Zhang, Lei, Ren, Haizhen, Li, Fan   +4 more
openaire   +1 more source

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs

Lecture Notes in Computer Science, 2023
Zhongzheng Tang, Zhuo Diao, Diao Zhuo
exaly  

Some Bounds on the Spectral Radius of Uniform Hypergraphs

Frontiers of Mathematics, 2023
You Lihua
exaly