Results 31 to 40 of about 653 (189)
$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
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +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
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
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
International Journal of Mathematics and Mathematical Sciences, 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
Decomposition of regular hypergraphs [PDF]
Journal of Combinatorics, 2018 An r-block is a 0, 1-matrix in which every row has sum r. Let Sn be the set of pairs (k, l) such that the columns of any (k+l)-block with n rows split into a k-block and an l-block. We determine Sn for n ≤ 5. In particular, S3 = {(k, l) : 2 | kl}, S4 = {(k, l) : (6 | k or l) and (1 / ∈ {k, l})}, and S5 = {(k, l) : 11 6= min{k, l} > 7 and each value in {
Jeong Ok Choi, Douglas B. West
openaire +1 more source