The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A340899 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A340899

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 4) missing three edges, where all three removed edges are incident to the same vertex in the 4-point set.
(history; published version)

#16 by Michael De Vlieger at Tue Jun 27 11:44:37 EDT 2023

STATUS

reviewed

approved

#15 by Michel Marcus at Tue Jun 27 11:42:00 EDT 2023

STATUS

proposed

reviewed

#14 by Michael De Vlieger at Tue Jun 27 11:36:45 EDT 2023

STATUS

editing

proposed

#13 by Michael De Vlieger at Tue Jun 27 11:36:44 EDT 2023

REFERENCES

S. Schlicker, R. Vasquez, R. Wofford, Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs. In preparation.

LINKS

Steven Schlicker, Roman Vasquez, and Rachel Wofford, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL26/Wofford/wofford4.html">Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs</a>, J. Int. Seq. (2023) Vol. 26, Art. 23.6.6.

STATUS

approved

editing

#12 by Wesley Ivan Hurt at Wed Apr 07 14:59:05 EDT 2021

STATUS

proposed

approved

#11 by Michel Marcus at Wed Apr 07 12:37:08 EDT 2021

STATUS

editing

proposed

#10 by Michel Marcus at Wed Apr 07 12:37:05 EDT 2021

COMMENTS

Take a complete bipartite graph K(4,n) (with n at least 4) having parts A and B where |A| = 4. This sequence gives the number of edge covers of the graph obtained from this K(4,n) graph after removing three edges, where where all three removed edges are incident same vertex in A.

STATUS

approved

editing

#9 by N. J. A. Sloane at Sun Mar 07 14:52:09 EST 2021

STATUS

editing

approved

#8 by N. J. A. Sloane at Sun Mar 07 14:52:06 EST 2021

CROSSREFS

Other sequences of segments from removing edges from bipartite graphs: A335608-A335613, A337416-A337418.

Polygonal chain sequences: A152927, A152928, A152929, A152930, A152931, A152932, A152933, A152934, A152939.

Other sequences of segments from removing edges from bipartite graphs A335608-A335613, A337416-A337418. Polygonal chain sequences A152927, A152928, A152929, A152930, A152931, A152932, A152933, A152934, A152939. Number of {0,1} n X n matrices with no zero rows or columns : A048291.

STATUS

proposed

editing

#7 by Stefano Spezia at Tue Jan 26 00:51:01 EST 2021

STATUS

editing

proposed