Results 51 to 60 of about 698,372 (216)
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
Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles [PDF]
Opuscula Mathematica, 2019 We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\)
Meihua, Meiling Guan, Jirimutu
doaj +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
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
Land Degradation &Development, EarlyView.ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley +1 more source
Randi´c Matrix and Randi´c Energy of Uniform Hypergraphs [PDF]
Mathematics Interdisciplinary ResearchThe Randi´c matrix $R=[r_{ij}]$ of a graph $ G=(V,E) $ was defined as $r_{ij}=\frac{1}{\sqrt{d_id_j}}$ if vertices $v_i$ and $v_j$ are adjacent and $r_{ij}=0$ otherwise, where $d_i$ is the degree of the vertex $v_i\in V$.
Gholam Hassan Shirdel +2 more
doaj +1 more source
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
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
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source