Results 1  10
of
1,772
Constructing rUniform Hypergraphs with Restricted Clique Numbers
, 2015
"... ABSTRACT. Ramsey theory has posed many interesting questions for graph theorists that have yet to be solved. Many different methods have been used to find Ramsey numbers, though very few are actually known. Because of this, more mathematical tools are needed to prove exact values of Ramsey numbers a ..."
Abstract
 Add to MetaCart
and their generalizations. Budden, Hiller, Lambert, and Sanford have created a lifting from graphs to 3uniform hypergraphs that has shown promise in extending known Ramsey results to hypergraphs. This paper will consider another analogous lifting for runiform hypergraphs and investigate the lifting of Turán graphs. 1.
A Skilled Secret Sharing Scheme for rUniform HypergraphBased Prohibited Structure
 Proceeding of the 23rd Workshop on Combinatorial Mathematics and Computation Theory, Chang Hua
, 2006
"... Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. If any unauthorized subset of participa ..."
Abstract
 Add to MetaCart
not reconstruct the secret. In this paper, we propose a new perfect secret sharing schemes for prohibited structure based on runiform hypergraph where a vertex denotes a participant and an edge is a set of participants who cannot recover the secret. The information rate of our schemes is max{r/(C(n 1, r 1) d + r
On decompositions of complete hypergraphs
, 2009
"... We study the minimum number of complete rpartite runiform hypergraphs needed to partition the edges of the complete runiform hypergraph on n vertices and we improve previous results of Alon. 1 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study the minimum number of complete rpartite runiform hypergraphs needed to partition the edges of the complete runiform hypergraph on n vertices and we improve previous results of Alon. 1
The Complexity of 2Coloring and Strong Coloring in Uniform Hypergraphs of High Minimum Degree
, 2013
"... In this paper we consider the problem of deciding whether a given runiform hypergraph H with minimum vertex ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of deciding whether a given runiform hypergraph H with minimum vertex
The Complexity of 2Coloring and Strong Coloring in Uniform Hypergraphs of High Minimum Degree
"... In this paper we consider the problem of deciding whether a given runiform hypergraph H with minimum vertex ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of deciding whether a given runiform hypergraph H with minimum vertex
Coloring Hfree hypergraphs
, 2008
"... Fix r ≥ 2 and a collection of runiform hypergraphs H. What is the minimum number of edges in an Hfree runiform hypergraph with chromatic number greater than k? We investigate this question for various H. Our results include the following: • An (r, l)system is an runiform hypergraph with every t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Fix r ≥ 2 and a collection of runiform hypergraphs H. What is the minimum number of edges in an Hfree runiform hypergraph with chromatic number greater than k? We investigate this question for various H. Our results include the following: • An (r, l)system is an runiform hypergraph with every
Loose Laplacian spectra of random hypergraphs
, 2011
"... Let H = (V,E) be an runiform hypergraph with the vertex set V and the edge set E. For 1 ≤ s ≤ r/2, we define a weighted graph G (s) on the vertex set () ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Let H = (V,E) be an runiform hypergraph with the vertex set V and the edge set E. For 1 ≤ s ≤ r/2, we define a weighted graph G (s) on the vertex set ()
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs
 ANNALS OF COMBINATORICS
, 2010
"... Edge colorings of runiform hypergraphs naturally define a multicoloring on the 2shadow, i.e., on the pairs that are covered by hyperedges. We show that in any (r − 1)coloring of the edges of an runiform hypergraph with n vertices and at least (1 − ε) ( n) r edges, the 2shadow has a monochromat ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Edge colorings of runiform hypergraphs naturally define a multicoloring on the 2shadow, i.e., on the pairs that are covered by hyperedges. We show that in any (r − 1)coloring of the edges of an runiform hypergraph with n vertices and at least (1 − ε) ( n) r edges, the 2shadow has a
Results 1  10
of
1,772