The uniformity space of hypergraphs and its applications
From MaRDI portal
Publication:1301700
DOI10.1016/S0012-365X(98)00344-6zbMath0932.05069MaRDI QIDQ1301700
Publication date: 13 March 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
On the existence of zero-sum perfect matchings of complete graphs ⋮ The well-covered dimension of random graphs ⋮ Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ The well-covered dimension of products of graphs ⋮ Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) ⋮ On zero-sum spanning trees and zero-sum connectivity
Cites Work
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Generalizations of magic graphs
- Magic graphs, a characterization
- A characterization of well covered graphs of girth 5 or greater
- The incidence matrix and labellings of a graph
- A complete characterization of the zero-sum (mod 2) Ramsey numbers
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Zero-sum bipartite Ramsey numbers
- WELL-COVERED GRAPHS: A SURVEY
- Recognizing Greedy Structures
- A characterization of Zm-well-covered graphs of girth 6 or more
- Some covering concepts in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The uniformity space of hypergraphs and its applications