On isomorphic subgraphs
This note is concerned with a question on the maximum possible \(s\) such that an arbitrary graph or hypergraph \(G\) contains a pair of edge disjoint isomorphic subgraphs of size \(s\). The authors investigate this question in the case of 3-uniform hypergraphs. Namely, it is proved that a 3-uniform hypergraph \(G\) of size \(q\) contains two edge disjoint isomorphic subgraphs of size at last \(\bigl\lfloor {1 \over 23}\sqrt q \bigr\rfloor\). They conclude with a conjecture that a \(k\)-uniform hypergraph of size \(q\) contains two isomorphic subgraphs of size \(cq^{2/(k+1)}\).
- Twins in graphs
- Self-similarity of graphs
- Isomorphism of (mis)Labeled Graphs
- Isomorphism of graphs which are pairwise k-separable
- Computing and Drawing Isomorphic Subgraphs
- scientific article; zbMATH DE number 4152423 (Why is no real title available?)
- scientific article; zbMATH DE number 1974109 (Why is no real title available?)
- Hypergraphs With Finitely Many Isomorphism Subtypes
- Isomorphic edge disjoint subgraphs of hypergraphs
- Subgraph isomorphism on graph classes that exclude a substructure
- Subgraph isomorphism on graph classes that exclude a substructure
- On the number of unique subgraphs of a graph
This page was built for publication: On isomorphic subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685560)
