Results 71 to 80 of about 1,981 (215)
Properties of Unique Degree Sequences of 3-Uniform Hypergraphs [PDF]
, 2021 International audienceIn 2018 Deza et al. proved the NP-completeness of deciding wether there exists a 3-uniform hypergraph compatible with a given degree sequence.
Lama Tarsissi +10 more
core +1 more source
Constrained Colouring and σ-Hypergraphs
Discussiones Mathematicae Graph Theory, 2015 A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
Axioms, 2021 The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang +3 more
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
Eigenvalues of K-Uniform Hypergraphs [PDF]
, 2017 A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master of Science in Mathematics, University of Regina.
Gorr, Adam Vernon
core
The number of connected sparsely edged uniform hypergraphs [PDF]
, 1997 Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/ log log r), is ...
kLuczak, Tomasz, Karoński, Michakl
core +1 more source
A Vulnerability Measure of k-Uniform Linear Hypergraphs [PDF]
, 2023 Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree of graphs is employed to measure the vulnerability of uniform linear ...
Yinkui Li, Haixing Zhao, Ning Zhao
core +1 more source
Anti-Ramsey Hypergraph Numbers
Electronic Journal of Graph Theory and Applications, 2021 The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Colorful Subhypergraphs in Uniform Hypergraphs
The Electronic Journal of Combinatorics, 2017 There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014 ...
openaire +3 more sources