Results 61 to 70 of about 8,142 (223)

A lifting of graphs to 3-uniform hypergraphs, its generalization, and further investigation of hypergraph Ramsey numbers [PDF]

, 2015
Ramsey theory has posed many interesting questions for graph theorists that have yet to besolved. Many different methods have been used to find Ramsey numbers, though very feware actually known.
NC DOCKS at Western Carolina University, Rapp, Aaron Frost   +1 more
core  

Connectivity in Hypergraphs [PDF]

, 2018
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from ...
Megan Dewar, David Pike, John Proos
core   +1 more source

Complement Reducible Uniform Hypergraphs

Axioms
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj   +1 more source

Hypergraph partitioning using tensor eigenvalue decomposition.

PLoS ONE, 2023
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source

Chain and threshold hypergraphs

AKCE International Journal of Graphs and Combinatorics
Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively.
Shashwath S. Shetty, Arathi Bhat K
doaj   +1 more source

Saliency Detection Method Using Hypergraphs on Adaptive Multiscales

IEEE Access, 2018
Saliency detection plays an important role in the fields of image processing and computer vision. We present an improved saliency detection method by means of hypergraphs on adaptive multi-scales (HAM).
Feilin Han, Aili Han, Jing Hao
doaj   +1 more source

Land Use and Land Cover Analysis for Solid Waste Management in NCT Delhi Using Fusion Aware Segformer

Land Degradation &Development, EarlyView.
ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley   +1 more source

Disperse hypergraphs

Combinatorics, Probability and Computing
Abstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire   +2 more sources

Nonintersecting ryser hypergraphs [PDF]

, 2020
A famous conjecture of Ryser states that every r-partite hypergraph has vertex cover number at most r 1 times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as r-Ryser hypergraphs, have been studied extensively ...
Bishnoi A., Pepe V.
core   +1 more source