scholarly journals 2-Colorability of r-Uniform Hypergraphs

10.37236/8205 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Michael Krul ◽  
Luboš Thoma
Keyword(s):  
Algebraic Characterization ◽  
Uniform Hypergraph ◽  
Uniform Hypergraphs

A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge is completely colored by a single color. We present a complete algebraic characterization of the 2-colorability of r-uniform hypergraphs. This generalizes a well known algebraic characterization of k-colorability of graphs due to Alon, Tarsi, Lovasz, de Loera, and Hillar. We also introduce a method for distinguishing proper 2-colorings called coloring schemes, and provide a decomposition of all proper 2-colorings into these schemes. As an application, we present a new example of a 4-uniform non-2-colorable hypergraph on 11 vertices and 24 edges which is not isomorphic to a well-known construction by Seymour (1974) of a minimal non-2-colorable 4-uniform hypergraph. Additionally, we provide a heuristically constructed hypergraph which admits only specific coloring schemes. Further, we give an algebraic characterization of the coloring scheme known as a conflict-free coloring.

scholarly journals New Results on Degree Sequences of Uniform Hypergraphs

10.37236/3414 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
Sarah Behrens ◽  
Catherine Erbes ◽  
Michael Ferrara ◽  
Stephen G. Hartke ◽  
Benjamin Reiniger ◽  
...  
Keyword(s):  
Efficient Algorithm ◽  
Necessary Conditions ◽  
Degree Sequence ◽  
Sufficient Conditions ◽  
Degree Sequences ◽  
Uniform Hypergraph ◽  
Graphic Sequence ◽  
Uniform Hypergraphs ◽  
Open Question

A sequence of nonnegative integers is $k$-graphic if it is the degree sequence of a $k$-uniform hypergraph. The only known characterization of $k$-graphic sequences is due to Dewdney in 1975. As this characterization does not yield an efficient algorithm, it is a fundamental open question to determine a more practical characterization. While several necessary conditions appear in the literature, there are few conditions that imply a sequence is $k$-graphic. In light of this, we present sharp sufficient conditions for $k$-graphicality based on a sequence's length and degree sum.Kocay and Li gave a family of edge exchanges (an extension of 2-switches) that could be used to transform one realization of a 3-graphic sequence into any other realization. We extend their result to $k$-graphic sequences for all $k \geq 3$. Finally we give several applications of edge exchanges in hypergraphs, including generalizing a result of Busch et al. on packing graphic sequences.

scholarly journals Self-complementing permutations of k-uniform hypergraphs

2009 ◽  
Vol Vol. 11 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Artur Szymański ◽  
Adam Pawel Wojda
Keyword(s):  
Positive Integer ◽  
Uniform Hypergraph ◽  
Uniform Hypergraphs ◽  
Unique Integer ◽  
International Audience ◽  
Sigma E

Graphs and Algorithms International audience A k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it is isomorphic with its complement (H) over bar = ( V; ((V)(k)) - E). Every permutation sigma of the set V such that sigma(e) is an edge of (H) over bar if and only if e is an element of E is called self-complementing. 2-self-comlementary hypergraphs are exactly self complementary graphs introduced independently by Ringel ( 1963) and Sachs ( 1962). <br> For any positive integer n we denote by lambda(n) the unique integer such that n = 2(lambda(n)) c, where c is odd. <br> In the paper we prove that a permutation sigma of [1, n] with orbits O-1,..., O-m O m is a self-complementing permutation of a k-uniform hypergraph of order n if and only if there is an integer l >= 0 such that k = a2(l) + s, a is odd, 0 <= s <= 2(l) and the following two conditions hold: <br> (i)n = b2(l+1) + r,r is an element of {0,..., 2(l) - 1 + s}, and <br> (ii) Sigma(i:lambda(vertical bar Oi vertical bar)<= l) vertical bar O-i vertical bar <= r. <br> For k = 2 this result is the very well known characterization of self-complementing permutation of graphs given by Ringel and Sachs.

scholarly journals Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees

10.37236/6644 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Liying Kang ◽  
Lele Liu ◽  
Erfang Shan
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Linear Algebra ◽  
Lower Bounds ◽  
Uniform Hypergraph ◽  
Uniform Hypergraphs ◽  
Signless Laplacian Tensor ◽  
Signless Laplacian ◽  
Vertex Degrees

Let $\mathcal{A}(H)$ and $\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\rho(H)$ and $\rho(\mathcal{Q}(H))$ the spectral radii of $\mathcal{A}(H)$ and $\mathcal{Q}(H)$, respectively. In this paper we present a  lower bound on $\rho(H)$ in terms of vertex degrees and we characterize the extremal hypergraphs attaining the bound, which solves a problem posed by Nikiforov [Analytic methods for uniform hypergraphs, Linear Algebra Appl. 457 (2014) 455–535]. Also, we prove a lower bound on $\rho(\mathcal{Q}(H))$ concerning degrees and give a characterization of the extremal hypergraphs attaining the bound.

scholarly journals Characterization of Dissipative Structures for First-Order Symmetric Hyperbolic System with General Relaxation

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 728
Author(s):  
Yasunori Maekawa ◽  
Yoshihiro Ueda
Keyword(s):  
Hyperbolic System ◽  
Dissipative Structure ◽  
Dissipative Structures ◽  
Algebraic Characterization ◽  
Symmetric Hyperbolic System ◽  
Full Generality ◽  
Order Linear ◽  
First Order

In this paper, we study the dissipative structure of first-order linear symmetric hyperbolic system with general relaxation and provide the algebraic characterization for the uniform dissipativity up to order 1. Our result extends the classical Shizuta–Kawashima condition for the case of symmetric relaxation, with a full generality and optimality.

An Axiomatic Characterization of a Class of Petri Nets

1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Axiomatic Characterization ◽  
Algebraic Characterization

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.

Algebraic characterization of bridged polycyclic compounds

1981 ◽  
Vol 19 (5) ◽  
pp. 929-955 ◽  
Author(s):  
Ov. Mekenyan ◽  
D. Bonchev ◽  
N. Trinajsti?
Keyword(s):  
Algebraic Characterization ◽  
Polycyclic Compounds

scholarly journals Algebraic Characterization of Rings of Continuousp-Adic Valued Functions

2015 ◽  
Vol 44 (2) ◽  
pp. 486-499
Author(s):  
Samuel Volkweis Leite ◽  
Alexander Prestel
Keyword(s):  
Algebraic Characterization

Decomposing Complete 3-Uniform Hypergraph into 5-Cycles

2014 ◽  
Vol 672-674 ◽  
pp. 1935-1939
Author(s):  
Guan Ru Li ◽  
Yi Ming Lei ◽  
Jirimutu
Keyword(s):  
Positive Integer ◽  
Hamiltonian Cycles ◽  
Uniform Hypergraph ◽  
Design Algorithm ◽  
Uniform Hypergraphs ◽  
Edge Partition ◽  
Definition Of

About the Katona-Kierstead definition of a Hamiltonian cycles in a uniform hypergraph, a decomposition of complete k-uniform hypergraph Kn(k) into Hamiltonian cycles studied by Bailey-Stevens and Meszka-Rosa. For n≡2,4,5 (mod 6), we design algorithm for decomposing the complete 3-uniform hypergraphs into Hamiltonian cycles by using the method of edge-partition. A decomposition of Kn(3) into 5-cycles has been presented for all admissible n≤17, and for all n=4m +1, m is a positive integer. In general, the existence of a decomposition into 5-cycles remains open. In this paper, we use the method of edge-partition and cycle sequence proposed by Jirimutu and Wang. We find a decomposition of K20(3) into 5-cycles.

Sign in / Sign up

Export Citation Format

Share Document