Graphs Having Small Number of Sizes on Induced k‐Subgraphs
From MaRDI portal
Publication:5454277
DOI10.1137/05064357XzbMath1138.05318MaRDI QIDQ5454277
József Balogh, Maria A. Axenovich
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
The multiplication table problem for bipartite graphs ⋮ Minimum difference representations of graphs ⋮ Induced subgraphs with distinct sizes ⋮ Anticoncentration for subgraph statistics ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs
This page was built for publication: Graphs Having Small Number of Sizes on Induced k‐Subgraphs
