Results 41 to 50 of about 538 (183)
Fixation dynamics on hypergraphs.
PLoS Computational Biology, 2023 Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals.
Ruodan Liu, Naoki Masuda
doaj +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
Discrete Mathematics, 1986 \textit{D. Buset} [Discrete Math. 57, 297-299 (1985; Zbl 0587.05030)] determined for \(k=2\) the sets of all pairs (a,b) such that there exists a k-uniform (connected k-uniform) hypergraph whose automorphism group has exactly a orbits on the set of vertices and b orbits on the set of edges. The author extended this result for arbitrary natural k.
openaire +2 more sources
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Two‐dimensional guillotine cutting problem for large objects with non‐rectangular shapes
International Transactions in Operational Research, EarlyView.Abstract In this paper, we address the two‐dimensional single large object placement problem with guillotine cutting constraints, focusing on non‐rectangular shapes. We consider objects with circular or convex polygonal geometries and study a variant that includes defective regions from which no items can be extracted. Rectangular items are cut using a
Carise E. Schmidt +3 more
wiley +1 more source
Kneser Colorings of Uniform Hypergraphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 Abstract For fixed positive integers r, k and l with l r , and an r-uniform hypergraph H, let κ ( H , k , l ) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least l vertices. Consider the function KC ( n , r , k , l ) = max H ∈
Carlos Hoppen +2 more
openaire +2 more sources
Chain and threshold hypergraphs
AKCE International Journal of Graphs and CombinatoricsThreshold 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
The Algebra of Signatures for Extreme Two-Uniform Hypergraphs
Axioms, 2023 In the last decade, several characterizations have been constructed for constructions such as extreme hypergraphs. One of the most recently described features is the signature. A signature is a number that uniquely describes an extremal and allows one to
Evgeniya Egorova +2 more
doaj +1 more source