Graphs Having Small Number of Sizes on Induced k‐Subgraphs

DOI10.1137/05064357XMaRDI QIDQ5454277zbMATH OpenFDO

Authors József Balogh, Maria Axenovich

Publication date 28 March 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

reconstructioninduced subgraphshomogeneous sets

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Induced subgraphs with distinct sizes
• On the number of homogeneous subgraphs of a graph
• Induced subgraphs with many distinct degrees
• On the number of distinct induced subgraphs of a graph
• Induced subgraphs of Ramsey graphs with many distinct degrees

Cited in

(11)

• Induced subgraphs with distinct sizes
• Minimum difference representations of graphs
• Proof of a conjecture on induced subgraphs of Ramsey graphs
• Anticoncentration for subgraph statistics
• Induced subgraphs with many distinct degrees
• scientific article; zbMATH DE number 4061279 (Why is no real title available?)
• The multiplication table problem for bipartite graphs
• Graphs with a small number of distinct induced subgraphs
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• On the number of distinct induced subgraphs of a graph
• On the number of homogeneous subgraphs of a graph

This page was built for publication: Graphs Having Small Number of Sizes on Induced k‐Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454277)