Results 11 to 20 of about 81 (80)
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +2 more sources
Large hypergraphs without tight cycles [PDF]
, 2021 An \(r\)-uniform tight cycle of length \(\ell>r\) is a hypergraph with vertices \(v_1,\dots,v_\ell\) and edges \(\{v_i,v_{i+1},\dots,v_{i+r-1}\}\) (for all \(i\)), with the indices taken modulo \(\ell\). It was shown by Sudakov and Tomon that for each
Janzer, Barnabás
core +1 more source
Disjoint dijoins for classes of dicuts in finite and infinite digraphs [PDF]
, 2022 A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of a set of edges meeting every non-empty dicut equals ...
Heuer, Karl +3 more
core +1 more source
Mathematics Subject Classification interrater agreement dataset [PDF]
, 2022 The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke +2 more
core +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
Малки неравномерни хиперграфи без свойство B [PDF]
, 2023 [Cherkashin Danila; Черкашин Данила]2020 Mathematics Subject Classification: 05C15 ...
Cherkashin, Danila
core
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
Discussiones Mathematicae Graph Theory, 2021 Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices.
Chen Pingge, Liang Jinhua, Peng Yuejian
doaj +1 more source
Packing in regular graphs [PDF]
, 2017 A set S of vertices in a graph G is a packing if the vertices in S are pairwise at distance at least 3 apart in G. The packing number of G, denoted by p(G), is the maximum cardinality of a packing in G. Favaron [Discrete Math. 158 (1996), 287–293] showed
Michael A. Henning +3 more
core +1 more source
Asymptotic Enumeration of Non-Uniform Linear Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 A linear hypergraph, also known as a partial Steiner system, is a collection of subsets of a set such that no two of the subsets have more than one element in common.
Hasheminezhad Mahdieh, McKay Brendan D.
doaj +1 more source
Niche Hypergraphs of Products of Digraphs
Discussiones Mathematicae Graph Theory, 2020 If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N_D^ + ( \upsilon ...
Sonntag Martin, Teichert Hanns-Martin
doaj +1 more source