Results 51 to 60 of about 11,124 (213)

Annotated hypergraphs: models and applications

Applied Network Science, 2020
Hypergraphs offer a natural modeling language for studying polyadic interactions between sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive roles.
Philip Chodrow, Andrew Mellor
doaj   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

On partitioning of hypergraphs

Discrete Mathematics, 2007
The edge-isoperimetric problem on graphs (EIP), namely for a given integer \(m\) and graph \(G=(V,E)\) to find a subset \(A\) of the vertices of \(G\) of cardinality \(m\) so that the number of edges of \(G\) connecting vertices in \(A\) to vertices in \(V\setminus A\), is minimized (version 1), or such that the number of edges of \(G\) induced by \(A\)
S. Bezrukov, Battiti, Roberto
openaire   +4 more sources

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

Disperse hypergraphs

Combinatorics, Probability and Computing
Abstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire   +2 more sources

07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs

, 2007
The following is a list of the problems presented on Monday, July 9, 2007 at the open-problem session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, held at Schloss Dagstuhl in Wadern ...
Stege, Ulrike, Marx, Daniel, Gutin, Gregory Z., Demaine, Erik   +3 more
core   +1 more source

Complement Reducible Uniform Hypergraphs

Axioms
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 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, Rapp, Aaron Frost   +1 more
core  

Hypergraph partitioning using tensor eigenvalue decomposition.

PLoS ONE, 2023
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj   +1 more source