Packing cliques in 3‐uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21717
Abstract: For positive integers n≥k≥t , a collection B of k ‐subsets of an n ‐set X is called a t ‐packing if every t ‐subset of X appears in at most one set in B… read more here.
Keywords: packing cliques; cliques uniform; uniform hypergraphs;
Almost t-complementary uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2019 at "Aequationes mathematicae"
DOI: 10.1007/s00010-018-0631-y
Abstract: An almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation $$\theta \in Sym(V)$$θ∈Sym(V) such that the sets $$E, E^\theta , E^{\theta ^2}, \ldots… read more here.
Keywords: uniform hypergraphs; almost complementary; permutation; complementary uniform ... See more keywords
Stability on Matchings in 3-Uniform Hypergraphs
Sign Up to like & getrecommendations! Published in 2022 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-022-02483-1
Abstract: Given a positive integer r , let $$[r]=\{1,\ldots ,r\}$$ [ r ] = { 1 , … , r } . Let n , m be positive integers such that n is sufficiently large and… read more here.
Keywords: uniform hypergraphs; stability matchings; matchings uniform;
The spectral radius and domination number in linear uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00424-y
Abstract: This paper investigates the spectral radius and signless Laplacian spectral radius of linear uniform hypergraphs. A dominating set in a hypergraph H is a subset D of vertices if for every vertex v not in… read more here.
Keywords: uniform hypergraphs; linear uniform; domination number; radius ... See more keywords
A Note on Generalized Lagrangians of Non-uniform Hypergraphs
Sign Up to like & getrecommendations! Published in 2017 at "Order"
DOI: 10.1007/s11083-016-9385-0
Abstract: Set A⊂ℕ$A\subset {\mathbb N}$ is less than B⊂ℕ$B\subset {\mathbb N}$ in the colex ordering if max(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets… read more here.
Keywords: colex ordering; edge type; question; uniform hypergraphs ... See more keywords
The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
Sign Up to like & getrecommendations! Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2021.112722
Abstract: In 1967 Harary, Hedetniemi, and Prins showed that every graph G admits a complete t-coloring for every t with χ(G) ≤ t ≤ ψ(G), where χ(G) denotes the chromatic number of G and ψ(G) denotes… read more here.
Keywords: uniform hypergraphs; complete coloring; interpolation property;
Spectral radius of uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2017 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.04.005
Abstract: Abstract We prove a result concerning the behavior of the spectral radius of a hypergraph under relocations of edges. We determine the unique hypergraphs with maximum spectral radius among connected k -uniform hypergraphs with fixed… read more here.
Keywords: spectral radius; maximum spectral; radius; uniform hypergraphs ... See more keywords
Lower bounds for the Aα-spectral radius of uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2021.08.021
Abstract: For 0 ≤ α < 1, the Aα-spectral radius of a k-uniform hypergraph G is defined to be the spectral radius of the tensor Aα(G) := αD(G) + (1 − α)A(G), where D(G) and A(G)… read more here.
Keywords: spectral radius; radius; lower bounds; bounds spectral ... See more keywords