Results 21 to 30 of about 418 (155)
$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
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
ON REGULARITY OF HYPERGRAPH SEQUENCES
Demonstratio Mathematica, 1994 The paper generalizes two notions connected with the asymptotic behaviour of a hypergraph: the regularity of the hypergraph and the independence of its edges. It is proved that the corresponding asymptotic regularity is equivalent to the average independence of its edges. Some applications to information systems are described.
Pomykała, J. A., Pomykała, J. M.
openaire +2 more sources
Mapping change in higher-order networks with multilevel and overlapping communities
Applied Network Science, 2023 New network models of complex systems use layers, state nodes, or hyperedges to capture higher-order interactions and dynamics. Simplifying how the higher-order networks change over time or depending on the network model would be easy with alluvial ...
Anton Holmgren +2 more
doaj +1 more source
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2016 A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +1 more source
Hypergraphs in m-Polar Fuzzy Environment
Mathematics, 2018 Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj +1 more source
Regular Partitions of Hypergraphs: Regularity Lemmas
Combinatorics, Probability and Computing, 2007 Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.
Vojtech Rödl, Mathias Schacht
openaire +2 more sources
Degrees and regularity of intuitionistic fuzzy semihypergraphs [PDF]
Notes on IFSThis research work takes a new paradigm on the hypergraph concept which is a combination of a hypergraph and a semigraph. A semihypergraph is a connected hypergraph in which each hyperedge must have at least three vertices and any two hyperedges have at ...
K. K. Myithili, P. Nithyadevi
doaj +1 more source
Matchings on Random Regular Hypergraphs
CoRR, 2021 We study the monomer--dimer partition function on the configuration model of random $d$-regular, $l$-uniform hypergraphs. For fixed $d,l\ge2$, we prove quenched free-energy limits in explicit parameter regimes. The proof combines fixed-density first-moment asymptotics, a two-overlap second-moment variational analysis, and a subgraph-conditioning ...
openaire +2 more sources
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Andrzej Dudek +3 more
openaire +2 more sources