On the number of homogeneous subgraphs of a graph
From MaRDI portal
Publication:759767
DOI10.1007/BF02579149zbMATH Open0554.05035MaRDI QIDQ759767FDOQ759767
Authors: László A. Székely
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55)
Cites Work
Cited In (16)
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs
- On the Profile of Multiplicities of Complete Subgraphs
- Distinct degrees and homogeneous sets
- Counting Subgraphs via Homomorphisms
- The number of edges in a subgraph of a Hamming graph
- Countable homogeneous multipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey-type theorems
- Title not available (Why is that?)
- Inequalities with respect to graph homomorphism
- Unavoidable subgraphs of colored graphs
- The last subconstituent of the Hemmeter graph
- Title not available (Why is that?)
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
- On the capacity of graphs
This page was built for publication: On the number of homogeneous subgraphs of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759767)