Results 191 to 200 of about 728,495 (209)
Some of the next articles are maybe not open access.
Greedy colorings of uniform hypergraphs
Random Structures & Algorithms, 2009AbstractWe 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 +3 more sources
On Sombor Index for Uniform Hypergraphs
Match Communications in Mathematical and in Computer ChemistrySummary: 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 +4 more
openaire +1 more source
Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs
Lecture Notes in Computer Science, 2023Zhongzheng Tang, Zhuo Diao
exaly
Some Bounds on the Spectral Radius of Uniform Hypergraphs
Frontiers of Mathematics, 2023Xiaona Fang, Yufei Huang
exaly
Regularity Lemma for k-uniform hypergraphs
Random Structures and Algorithms, 2004Jozef Skokan, Vojtech Rödl
exaly
Around Erdős–Lovász problem on colorings of non-uniform hypergraphs
Discrete Mathematics, 2015Dmitry A Shabanov
exaly
On Ramsey numbers of uniform hypergraphs with given maximum degree
Journal of Combinatorial Theory - Series A, 2006V Rödl, A V Kostochka
exaly
Tight Hamilton cycles in random uniform hypergraphs
Random Structures and Algorithms, 2013Andrzej Dudek, Alan M. Frieze
exaly