Results 61 to 70 of about 728,495 (209)
Self-complementing permutations of k-uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Graphs and ...
Artur Szymański, Adam Pawel Wojda
doaj +1 more source
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
From Finding a Spanning Subgraph H $H$ to an H $H$‐Factor
Journal of Graph Theory, EarlyView.ABSTRACT A typical Dirac‐type problem in extremal graph theory is to determine the minimum degree threshold for a graph G $G$ to have a spanning subgraph H $H$, for example, the Dirac theorem. A natural follow‐up problem is to seek an H $H$‐factor, which is a spanning set of vertex‐disjoint copies of H $H$.
Allan Lo
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
A lifting of graphs to 3-uniform hypergraphs, its generalization, and further investigation of hypergraph Ramsey numbers [PDF]
, 2015 Ramsey theory has posed many interesting questions for graph theorists that have yet to besolved. Many different methods have been used to find Ramsey numbers, though very feware actually known.
NC DOCKS at Western Carolina University +1 more
core
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
, 2009 Chvatal, Rodl, Szemer,di and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6,23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to kappa-uniform hypergraphs
Kühn, D. +7 more
core +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