Results 1 to 10 of about 7,886 (170)
Maximum Hypergraphs without Regular Subgraphs
Discussiones Mathematicae Graph Theory, 2014 We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 ...
Kim Jaehoon, Kostochka Alexandr V.
doaj +2 more sources
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. [PDF]
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +2 more sources
Regularity and duality of intuitionistic fuzzy k-partite hypergraphs [PDF]
Notes on IFS, 2023 A graph in which the edge can connect more than two vertices is called a Hypergraph. A k-partite hypergraph is a hypergraph whose vertices can be split into k different independent sets. In this paper, regular, totally regular, totally irregular, totally
K. K. Myithili, R. Keerthika
doaj +1 more source
Spectra of Random Regular Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2021 In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs. We then relate the second eigenvalues to both its expansion property and the mixing rate of the non-backtracking random walk on regular ...
Dumitriu, Ioana, Zhu, Yizhe
openaire +3 more sources
The existence of bipartite almost self-complementary 3-uniform hypergraphs [PDF]
Opuscula Mathematica, 2023 An almost self-complementary 3-uniform hypergraph on \(n\) vertices exists if and only if \(n\) is congruent to 3 modulo 4 A hypergraph \(H\) with vertex set \(V\) and edge set \(E\) is called bipartite if \(V\) can be partitioned into two subsets \(V_1\
L.N. Kamble +2 more
doaj +1 more source
Definable Regularity Lemmas for Nip Hypergraphs [PDF]
The Quarterly Journal of Mathematics, 2021 AbstractWe present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results of Alon-Fischer-Newman and Lov\'asz-Szegedy for graphs of bounded VC-dimension.
Chernikov, Artem, Starchenko, Sergei
openaire +5 more sources
$L_p$ regular sparse hypergraphs [PDF]
Fundamenta Mathematicae, 2018 We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as $L_p$ regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a question of Borgs, Chayes, Cohn and Zhao.
Dodos, P. +2 more
openaire +3 more sources
Semi-Supervised Classification via Hypergraph Convolutional Extreme Learning Machine
Applied Sciences, 2021 Extreme Learning Machine (ELM) is characterized by simplicity, generalization ability, and computational efficiency. However, previous ELMs fail to consider the inherent high-order relationship among data points, resulting in being powerless on ...
Zhewei Liu +4 more
doaj +1 more source
An Algorithmic Hypergraph Regularity Lemma [PDF]
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015 AbstractSzemerédi 's Regularity Lemma is a powerful tool in graph theory. It asserts that all large graphs admit bounded partitions of their edge sets, most classes of which consist of uniformly distributed edges. The original proof of this result was nonconstructive, and a constructive proof was later given by Alon, Duke, Lefmann, Rödl, and Yuster ...
Nagle, Brendan +2 more
openaire +2 more sources
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Cross-modal remote sensing (RS) image retrieval aims to retrieve RS images using other modalities (e.g., text) and vice versa. The relationship between objects in the RS image is complex, i.e., the distribution of multiple types of objects is uneven ...
Fanglong Yao +6 more
doaj +1 more source